Coloring Meyniel graphs in linear time
From MaRDI portal
Recommendations
Cites work
- A fast algorithm for coloring Meyniel graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- An O(n^2) algorithm to color Meyniel graphs
- Connected sequential colourings
- Even pairs
- Holes and dominoes in Meyniel graphs
- scientific article; zbMATH DE number 3878985 (Why is no real title available?)
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- scientific article; zbMATH DE number 3556145 (Why is no real title available?)
- New methods to color the vertices of a graph
- On a conjecture of Meyniel
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
Cited in
(9)- Coloring Artemis graphs
- On a conjecture of Meyniel
- A fast algorithm for coloring Meyniel graphs
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- scientific article; zbMATH DE number 3878985 (Why is no real title available?)
- Coloring vertices of a graph or finding a Meyniel obstruction
- Holes and dominoes in Meyniel graphs
- An O(n^2) algorithm to color Meyniel graphs
- Erratum : MCColor is not optimal on Meyniel graphs
This page was built for publication: Coloring Meyniel graphs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439304)