Coloring Artemis graphs
From MaRDI portal
Publication:1019741
DOI10.1016/J.TCS.2009.02.012zbMATH Open1165.05027OpenAlexW2056768472MaRDI QIDQ1019741FDOQ1019741
Authors: Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon, Bruce Reed 
Publication date: 28 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.012
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- The strong perfect graph theorem
- Weakly triangulated graphs
- Meyniel weakly triangulated graphs. I: Co-perfect orderability
- A class of perfectly contractile graphs
- Title not available (Why is that?)
- Algorithms for Perfectly Contractile Graphs
- Perfectly contractile graphs
- Title not available (Why is that?)
- On the complexity of recognizing perfectly orderable graphs
- Improved algorithms for weakly chordal graphs
- Title not available (Why is that?)
- Even pairs in Berge graphs
- Even pairs
- On the perfect graph conjecture
- Title not available (Why is that?)
- An \(O(n^2)\) algorithm to color Meyniel graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Robust algorithms for restricted domains
- Precoloring extension of co-Meyniel graphs
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
Cited In (4)
This page was built for publication: Coloring Artemis graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019741)
