Edge-Coloring Partialk-Trees

DOI10.1006/jagm.1996.0061zbMath0864.68071OpenAlexW2010629352WikidataQ56390717 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

zbMATH Keywords

edge-coloring\(k\)-trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

A polynomial time algorithm for strong edge coloring of partial \(k\)-trees ⋮ The parameterised complexity of list problems on graphs of bounded treewidth ⋮ Colorings with few colors: counting, enumeration and combinatorial bounds ⋮ Linear arboricity of degenerate graphs ⋮ Chromatic index, treewidth and maximum degree ⋮ Algorithms for finding distance-edge-colorings of graphs ⋮ Chromatic index, treewidth and maximum degree ⋮ The edge-disjoint paths problem is NP-complete for series-parallel graphs ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ List Edge-Coloring and Total Coloring in Graphs of Low Treewidth ⋮ Clique-perfectness of complements of line graphs ⋮ Mixed graph edge coloring ⋮ A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES

This page was built for publication: Edge-Coloring Partialk-Trees