Edge coloring nearly bipartite graphs
From MaRDI portal
Publication:1306362
DOI10.1016/S0167-6377(98)00041-8zbMath1063.05048OpenAlexW2019936340MaRDI QIDQ1306362
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
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