Coloring Meyniel graphs in linear time

15 years 2 months ago

Download www.lirmm.fr

A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size.

Benjamin Lévêque, Frédé

Real-time Traffic

CORR 2004 | Education | Linear-Time Algorithm | Meyniel Graph | Odd Cycle |

claim paper

» On the Complexity of Some Colorful Problems Parameterized by Treewidth

» A Lower Bound for Testing 3Colorability in BoundedDegree Graphs

» MultiColor Pebble Motion on Graphs

» Graph Subcolorings Complexity and Algorithms

» Coloring unstructured wireless multihop networks

» Extended Linear Scan An Alternate Foundation for Global Register Allocation

» Intervalizing kColored Graphs

» Balanced Paths in Colored Graphs

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CORR
Authors	Benjamin Lévêque, Frédéric Maffray

Comments (0)

Sciweavers

Coloring Meyniel graphs in linear time

CORR 2004 | Education | Linear-Time Algorithm | Meyniel Graph | Odd Cycle |

Explore & Download

Productivity Tools

Sciweavers