English: A line perfect graph. These may equivalently be described as graphs whose line graphs are perfect, graphs with no odd cycle of length greater than three, or graphs in which each biconnected component is bipartite, K4, or K1,1,n. The edge colors indicate the type of each biconnected component: black for bipartite, blue for K4, and red for K1,1,n.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
http://creativecommons.org/publicdomain/zero/1.0/deed.enCC0Creative Commons Zero, Public Domain Dedicationfalsefalse
Captions
Add a one-line explanation of what this file represents