Partial \(k\)-trees with maximum chromatic number

DOI10.1016/S0012-365X(02)00586-1zbMath1008.05032OpenAlexW2024317774MaRDI QIDQ1861220

Janka Chlebíková

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

zbMATH Keywords

treewidthchromatic numberclique numberpartial \(k\)-tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

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