Edge-Coloring Partialk-Trees
From MaRDI portal
Publication:3837389
DOI10.1006/jagm.1996.0061zbMath0864.68071WikidataQ56390717 ScholiaQ56390717MaRDI QIDQ3837389
Xiao Zhou, Shin-ichi Nakano, Takao Nishizeki
Publication date: 8 December 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0061
68R10: Graph theory (including graph drawing) in computer science
Related Items
A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES, Chromatic index, treewidth and maximum degree, Chromatic index, treewidth and maximum degree, The edge-disjoint paths problem is NP-complete for series-parallel graphs, Clique-perfectness of complements of line graphs, The parameterised complexity of list problems on graphs of bounded treewidth, Mixed graph edge coloring, A polynomial time algorithm for strong edge coloring of partial \(k\)-trees, Colorings with few colors: counting, enumeration and combinatorial bounds, Algorithms for finding distance-edge-colorings of graphs, List Edge-Coloring and Total Coloring in Graphs of Low Treewidth, Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds