Partial \(k\)-trees with maximum chromatic number
From MaRDI portal
Publication:1861220
DOI10.1016/S0012-365X(02)00586-1zbMath1008.05032OpenAlexW2024317774MaRDI QIDQ1861220
Publication date: 16 March 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00586-1
Related Items (3)
The \(d\)-precoloring problem for \(k\)-degenerate graphs ⋮ Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring
This page was built for publication: Partial \(k\)-trees with maximum chromatic number