Pages that link to "Item:Q1111563"
From MaRDI portal
The following pages link to A fast algorithm for coloring Meyniel graphs (Q1111563):
Displaying 17 items.
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- Perfectly contractile graphs (Q803147) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- COSINE: A new graph coloring algorithm (Q1180823) (← links)
- Path parity and perfection (Q1356748) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- HOLES AND DOMINOES IN MEYNIEL GRAPHS (Q5248996) (← links)
- Recognition of quasi-Meyniel graphs (Q5951967) (← links)
- Perfectly contractile graphs and quadratic toric rings (Q6096783) (← links)
