Colouring Some Classes of Perfect Graphs Robustly

DOI10.1016/J.ENDM.2005.06.083MaRDI QIDQ3439399zbMATH OpenOpenAlexFDO

Authors Kathie Cameron, Jack Edmonds

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 graphperfect graphgraph colouringexistentially polytime theoremmeyniel graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1944138
• Perfect colorings of regular graphs
• Defective coloring on classes of perfect graphs
• Defective Coloring on Classes of Perfect Graphs
• scientific article; zbMATH DE number 863472
• Colouring perfect graphs with bounded clique number
• An algorithm for coloring some perfect graphs
• scientific article; zbMATH DE number 1033812
• Reconfiguration of colorable sets in classes of perfect graphs
• Reconfiguration of Colorable Sets in Classes of Perfect Graphs

Cites work

• scientific article; zbMATH DE number 437537 (Why is no real title available?)
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3878985 (Why is no real title available?)
• scientific article; zbMATH DE number 4199652 (Why is no real title available?)
• scientific article; zbMATH DE number 3904622 (Why is no real title available?)
• scientific article; zbMATH DE number 3606484 (Why is no real title available?)
• A fast algorithm for coloring Meyniel graphs
• Algorithms on circular-arc graphs
• An O(n^2) algorithm to color Meyniel graphs
• Efficient graph representations
• Linear-time recognition of circular-arc graphs
• On a conjecture of Meyniel
• The strong perfect graph theorem

Cited in

(8)

• Solving problems on special classes of graphs
• scientific article; zbMATH DE number 1033812 (Why is no real title available?)
• Reconfiguration of colorable sets in classes of perfect graphs
• A PPA parity theorem about trees in a bipartite graph
• scientific article; zbMATH DE number 863472 (Why is no real title available?)
• Co-bipartite neighborhood edge elimination orderings
• The robust coloring problem.
• Reconfiguration of Colorable Sets in Classes of Perfect Graphs

This page was built for publication: Colouring Some Classes of Perfect Graphs Robustly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439399)