Edge coloring nearly bipartite graphs

DOI10.1016/S0167-6377(98)00041-8MaRDI QIDQ1306362zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3470445 (Why is no real title available?)
• Asymptotics of the chromatic index for multigraphs
• Edge coloring regular graphs of high degree
• Odd Minimum Cut-Sets and b-Matchings
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• The NP-Completeness of Edge-Coloring

Cited in

(12)

• Edge-coloring almost bipartite multigraphs
• Edge covering coloring of nearly bipartite graphs
• Edge-Coloring Bipartite Graphs
• The proportional coloring problem: optimizing buffers in radio mesh networks
• A linear time algorithm for determining almost bipartite graphs
• New algorithm for calculating chromatic index of graphs and its applications
• Algorithms for edge coloring bipartite graphs
• The edge-cochromatic number of bipartite graph
• Parameterized coloring problems on chordal graphs
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
• On \(f\)-edge cover coloring of nearly bipartite graphs
• scientific article; zbMATH DE number 1418353 (Why is no real title available?)

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)