Colouring Some Classes of Perfect Graphs Robustly

DOI10.1016/j.endm.2005.06.083zbMath1200.05219OpenAlexW2066202945MaRDI QIDQ3439399

Jack Edmonds, Kathie Cameron

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.083

zbMATH Keywords

intersection graphgraph colouringperfect graphexistentially polytime theoremmeyniel graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items

A PPA parity theorem about trees in a bipartite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• On a conjecture of Meyniel
• A fast algorithm for coloring Meyniel graphs
• Efficient graph representations
• Linear-time recognition of circular-arc graphs
• Algorithms on circular-arc graphs
• An \(O(n^2)\) algorithm to color Meyniel graphs