Line perfect graph
In graph theory, a line perfect graph is a graph whose line graph is a perfect graph. Equivalently, these are the graphs in which every odd-length simple cycle is a triangle.[1]
A graph is line perfect if and only if each of its biconnected components is a bipartite graph, the complete graph K4, or a triangular book K1,1,n.[2] Because these three types of biconnected component are all perfect graphs themselves, every line perfect graph is itself perfect.[1] By similar reasoning, every line perfect graph is a parity graph,[3] a Meyniel graph,[4] and a perfectly orderable graph.
Line perfect graphs generalize the bipartite graphs, and share with them the properties that the maximum matching and minimum vertex cover have the same size, and that the chromatic index equals the maximum degree.[5]
See also
- Strangulated graph, a graph in which every peripheral cycle is a triangle
References
- ↑ 1.0 1.1 Trotter, L. E., Jr. (1977), "Line perfect graphs", Mathematical Programming 12 (2): 255–259, doi:10.1007/BF01593791
- ↑ Maffray, Frédéric (1992), "Kernels in perfect line-graphs", Journal of Combinatorial Theory, Series B 55 (1): 1–8, doi:10.1016/0095-8956(92)90028-V.
- ↑ Template:Cite Geometric Algorithms and Combinatorial Optimization
- ↑ Wagler, Annegret (2001), "Critical and anticritical edges in perfect graphs", Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14–16, 2001, Proceedings, Lecture Notes in Computer Science, 2204, Berlin: Springer, pp. 317–327, doi:10.1007/3-540-45477-2_29.
- ↑ de Werra, D. (1978), "On line-perfect graphs", Mathematical Programming 15 (2): 236–238, doi:10.1007/BF01609025.
 |  |
