Line perfect graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1977 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 12, pages 255-259 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Leslie E. Trotter Jr.;

doi: 10.1007/bf01593791

Line perfect graphs

- Summary
- Subjects
- Metrics

Abstract

The concept of line perfection of a graph is defined so that a simple graph is line perfect if and only if its line graph is perfect in the usual sense. Line perfect graphs are characterized as those which contain no odd cycles of size larger than 3. Two well-know theorems of Konig for bipartite graphs are shown to hold also for line perfect graphs; this extension provides a reinterpretation of the content of these theorems.

Related Organizations

Cornell University
United States

Keywords

Graph theory, Extremal problems in graph theory

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).	42
	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.	Top 10%
	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 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average