Category:Perfect graphs
Jump to navigation
Jump to search
Template:Cat main A graph is perfect if it can be colored with as many colors as it has vertices in its maximum clique, and if moreover the same property is true in every induced subgraph. This category collects families of graphs that are notable for being perfect, as well as some related mathematical results.
Script error: No such module "anchor".Pages in category "Perfect graphs"
The following 16 pages are in this category, out of 16 total. This list may not reflect recent changes.