Pages that link to "Item:Q5937923"
From MaRDI portal
The following pages link to An \(O(n^2)\) algorithm to color Meyniel graphs (Q5937923):
Displaying 9 items.
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- A fast algorithm for coloring Meyniel graphs (Q1111563) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly (Q6599810) (← links)