Edge coloring nearly bipartite graphs

Authors:
Bruce Reed
Affiliations:
CNRS, Paris, France
Venue:
Operations Research Letters
Year:
1999

Citing 1
Cited 2

Asymptotics of the chromatic index for multigraphs

Journal of Combinatorial Theory Series B

Parameterized coloring problems on chordal graphs

Theoretical Computer Science - Parameterized and exact computation
Minimum fill-in and treewidth of split+ke and split+kv graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a simple polynomial time algorithm to compute the chromatic index of graphs which can be made bipartite by deleting a vertex. An analysis of this algorithm shows that for such graphs, the chromatic index is the roundup of the fractional chromatic index.