Coloring Meyniel graphs in linear time

DOI10.1016/j.endm.2005.06.005zbMath1137.05310OpenAlexW4298742049MaRDI QIDQ3439304

Frédéric Maffray, Benjamin Lévêque

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.005

zbMATH Keywords

algorithmperfect graphscoloringMeyniel graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture of Meyniel
• A fast algorithm for coloring Meyniel graphs
• Connected sequential colourings
• 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
• Algorithmic Aspects of Vertex Elimination on Graphs
• New methods to color the vertices of a graph
• HOLES AND DOMINOES IN MEYNIEL GRAPHS
• An \(O(n^2)\) algorithm to color Meyniel graphs

This page was built for publication: Coloring Meyniel graphs in linear time