Tree-coloring problems of bounded treewidth graphs

Li Bi; Xin Zhang

doi:10.1007/s10878-019-00461-7

ScienceGate Book Chapters

JOURNAL ARTICLE

Tree-coloring problems of bounded treewidth graphs

Li Bi Xin Zhang

Year: 2019 Journal: Journal of Combinatorial Optimization Vol: 39 (1)Pages: 156-169 Publisher: Springer Science+Business Media

DOI: 10.1007/s10878-019-00461-7

Get Full-Text PDF Get Analytical Report

Keywords:

Treewidth Combinatorics Tree-depth Parameterized complexity Mathematics Tree decomposition Partial k-tree Graph coloring Discrete mathematics Bounded function 1-planar graph Graph Chordal graph Pathwidth Line graph

Metrics

Cited By

2.14

FWCI (Field Weighted Citation Impact)

Refs

0.88

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Tree-coloring problems of bounded treewidth graphs

Metrics

Citation History

Topics

Related Documents

Equitable list tree-coloring of bounded treewidth graphs

Clustered coloring of graphs with bounded layered treewidth and bounded degree

Treewidth of treewidth-bounded graphs

Neighbor sum distinguishing total coloring of graphs with bounded treewidth

Recognizing treewidth-bounded graphs