On the $1.1$ Edge-Coloring of Multigraphs
From MaRDI portal
Publication:3480065
DOI10.1137/0403035zbMath0702.05036MaRDI QIDQ3480065
Kenichi Kashiwagi, Takao Nishizeki
Publication date: 1990
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403035
05C15: Coloring of graphs and hypergraphs
Related Items
The complexity of path coloring and call scheduling, A brief history of edge-colorings – with personal reminiscences, Efficiently list‐edge coloring multigraphs asymptotically optimally, Improving a family of approximation algorithms to edge color multigraphs, Approximating the chromatic index of multigraphs, Inapproximability and approximability of minimal tree routing and coloring, Graph edge colouring: Tashkinov trees and Goldberg's conjecture, Combinatorial algorithms for data migration to minimize average completion time, Efficient algorithms for wavelength assignment on trees of rings, On Vizing's bound for the chromatic index of a multigraph, Graph edge coloring: a survey, Chromatic index determined by fractional chromatic index, A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree, Structural properties of edge-chromatic critical multigraphs, Algorithms for data migration, Path multicoloring with fewer colors in spiders and caterpillars, An upper bound for the chromatic number of line graphs, From the quantum approximate optimization algorithm to a quantum alternating operator ansatz, Vizing's coloring algorithm and the fan number, On a theorem of Goldberg, Bounding χ in terms of ω and Δ for quasi-line graphs
