Classes of perfect graphs

2006/08/07 by Stefan Hougardy · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Conjecture #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Line graph #Mathematics #Pathwidth #Perfect graph #Perfect graph theorem #Split graph #Strong perfect graph theorem #Trivially perfect graph #Voltage graph

paper · doi:10.1016/j.disc.2006.05.021

openalex publication_date 2006/08/07 · crossref created 2006/08/07 · crossref issued 2006/10/01 · crossref published 2006/10/01 · crossref published-print 2006/10/01 · crossref deposited 2023/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/03/10 · crossref indexed 2026/04/30

Citations

• Representation of a finite graph by a set of intervals on the real line
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Complement reducible graphs
• The complexity of theorem-proving procedures
• A Characterization of Comparability Graphs and of Interval Graphs
• The clique problem for planar graphs
• Decomposition by clique separators
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
• Partially Ordered Sets

Cited by

• Perfect graph [wikipedia]