On the coloration of perfect graphs

2003/01/01 by Frédéric Maffray, F. Maffray · 3 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Brooks' theorem #Chordal graph #Chromatic scale #Combinatorics #Complete coloring #Discrete mathematics #Edge coloring #Graph #Graph Labeling and Dimension Problems #Graph power #Limits and Structures in Graph Theory #Line graph #Mathematics #Partition (number theory)

paper · doi:10.1007/0-387-22444-0_3

crossref issued 2003/01/01 · crossref published 2003/01/01 · crossref published-print 2003/01/01 · openalex publication_date 2003/01/01 · crossref created 2006/05/16 · crossref deposited 2023/05/07 · crossref indexed 2024/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Star-cutsets and perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Modern Graph Theory
• On the hardness of approximating minimization problems
• A Characterization of Comparability Graphs and of Interval Graphs
• Characterizations of derived graphs
• A characterization of perfect graphs
• The NP-Completeness of Edge-Coloring
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Sur le coloriage des graphs
• Graph Theory and Probability

Cited by

• Graph colouring algorithms
• Chordal graph [wikipedia]
• Comparability graph [wikipedia]