Equitable list tree-coloring of bounded treewidth graphs

DOI10.1016/J.TCS.2020.11.016MaRDI QIDQ2220879zbMATH OpenOpenAlexFDO

Authors Yan Li, Xin Zhang

Publication date 25 January 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.11.016

zbMATH Keywords

arboricityequitable coloringlist coloringtree coloringtreewidth

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Equitable list coloring and treewidth
• Equitable colorings of bounded treewidth graphs
• Mathematical Foundations of Computer Science 2004
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• On the Complexity of Some Colorful Problems Parameterized by Treewidth

Cites work

• Analyzing lattice networks through substructures
• Complexity of Finding Embeddings in a k-Tree
• Equitable list coloring and treewidth
• Equitable list point arboricity of graphs
• Equitable list vertex colourability and arboricity of grids
• Graph theory
• scientific article; zbMATH DE number 5968954 (Why is no real title available?)
• scientific article; zbMATH DE number 4103086 (Why is no real title available?)
• On equitable list arboricity of graphs
• Smallest-last ordering and clustering and graph coloring algorithms
• Structural Properties of Sparse Graphs

Cited in

(8)

• Theoretical aspects of equitable partition of networks into sparse modules
• Complexity of tree-coloring interval graphs equitably
• Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• Equitable and list equitable colorings of graphs with bounded maximum average degree.
• On equitable list arboricity of graphs
• Mathematical Foundations of Computer Science 2004
• Equitable vertex arboricity of graphs with low maximum degree

This page was built for publication: Equitable list tree-coloring of bounded treewidth graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220879)