An algorithm for coloring some perfect graphs
From MaRDI portal
Publication:1382811
DOI10.1016/S0012-365X(97)00082-4zbMATH Open0895.05023MaRDI QIDQ1382811FDOQ1382811
Authors: Sylvain Gravier, Frédéric Maffray, Hacène Ait Haddadene 
Publication date: 14 September 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Precoloring Extension III: Classes of Perfect Graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- On-line coloring of perfect graphs
- Perfect graphs
- scientific article
- scientific article
- scientific article; zbMATH DE number 3869356
- Perfectly colorable graphs
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On rigid circuit graphs
- The splittance of a graph
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Title not available (Why is that?)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- On weakly diamond-free Berge graphs
Cited In (13)
- An exact method for graph coloring
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Colouring Some Classes of Perfect Graphs Robustly
- On word colourings and some perfect graphs
- An algorithm for colouring perfect planar graphs
- Perfect and locally perfect colorings
- On Tucker vertices of graphs
- Title not available (Why is that?)
- Coloring perfect \((K_ 4\)-e)-free graphs
- Perfect colorings of the prism graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
This page was built for publication: An algorithm for coloring some perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382811)
