Category:Perfect graphs

The main article for this category is Perfect graph.

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.

Subcategories

This category has only the following subcategory.

Next items are not visible in browsers without Javascript

B

Next items are not visible in browsers without Javascript

This category content has been reduced to only pages contained in the ZIM file.

This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.