Edge coloring nearly bipartite graphs

DOI10.1016/S0167-6377(98)00041-8zbMath1063.05048OpenAlexW2019936340MaRDI QIDQ1306362

Bruce A. 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

Mathematics Subject Classification ID

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

Related Items

Parameterized coloring problems on chordal graphs, THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS, Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs

Cites Work

• Unnamed Item
• Asymptotics of the chromatic index for multigraphs
• Edge coloring regular graphs of high degree
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte