Edge coloring nearly bipartite graphs

DOI10.1016/S0167-6377(98)00041-8zbMATH Open1063.05048OpenAlexW2019936340MaRDI QIDQ1306362FDOQ1306362

Authors: Bruce Reed 

Publication date: 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00041-8

Recommendations

• Edge-coloring almost bipartite multigraphs
• Algorithms for edge coloring bipartite graphs
• Edge-Coloring Bipartite Graphs
• Experimental and Efficient Algorithms
• Edge-coloring of multigraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• The NP-Completeness of Edge-Coloring
• Asymptotics of the chromatic index for multigraphs
• Title not available (Why is that?)
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Odd Minimum Cut-Sets and b-Matchings
• Edge coloring regular graphs of high degree

Cited In (8)

• On \(f\)-edge cover coloring of nearly bipartite graphs
• Title not available (Why is that?)
• Edge covering coloring of nearly bipartite graphs
• Parameterized coloring problems on chordal graphs
• The edge-cochromatic number of bipartite graph
• THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS
• Edge-Coloring Bipartite Graphs
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs

This page was built for publication: Edge coloring nearly bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306362)