scientific article; zbMATH DE number 7058467

zbMath1411.05089arXiv1810.13036MaRDI QIDQ5377224

Carlos Vinícius G. C. Lima, Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1810.13036

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treewidthchordal graphsparameterized complexityequitable coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Iterated Type Partitions ⋮ Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Unnamed Item ⋮ Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Complexity of tree-coloring interval graphs equitably

This page was built for publication: