Slim graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1989 English Publisher:Springer Science and Business Media LLCJournal:Graphs and Combinatorics, volume 5, pages 149-157 (issn: 0911-0119, eissn: 1435-5914,

Copyright policy )

Authors: Alain Hertz;

doi: 10.1007/bf01788666

Slim graphs

- Summary
- Subjects
- Metrics

Abstract

The author investigates Slim graphs which can be obtained by deleting in a Meyniel graph G all the edges induced by an arbitrary set of nodes. Besides proving that Slim graphs are perfect a simple proof of the conjecture is given that Meyniel graphs are locally perfect graphs.

Related Organizations

École Polytechnique Fédérale de Lausanne EPFL
Switzerland

Keywords

Graph theory, locally perfect graphs, Slim graphs, strong perfect graph conjecture, Meyniel graphs, Structural characterization of families of graphs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	13
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average