JOURNAL ARTICLE
Equitable colorings of bounded treewidth graphs
Hans L. BodlaenderFedor V. Fomin
Year: 2005 Journal: Theoretical Computer Science Vol: 349 (1)Pages: 22-30 Publisher: Elsevier BV
Keywords:
Treewidth Combinatorics Bounded function Mathematics Graph coloring Partial k-tree 1-planar graph Discrete mathematics Tree-depth Graph Pathwidth Chordal graph Line graph
Metrics
68
Cited By
2.45
FWCI (Field Weighted Citation Impact)
37
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
Limits and Structures in Graph Theory
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
BOOK-CHAPTER
Equitable Colorings of Bounded Treewidth Graphs
Hans L. BodlaenderFedor V. Fomin
Lecture notes in computer science Year: 2004 Pages: 180-190
BOOK-CHAPTER
Computing Square Colorings on Bounded-Treewidth and Planar Graphs
Akanksha AgrawalDániel MarxDaniel NeuenJasper Slusallek
Society for Industrial and Applied Mathematics eBooks Year: 2023 Pages: 2087-2110
JOURNAL ARTICLE
Equitable list tree-coloring of bounded treewidth graphs
Journal: Theoretical Computer Science Year: 2020 Vol: 855 Pages: 61-67
BOOK-CHAPTER
Treewidth of treewidth-bounded graphs
Lecture notes in computer science Year: 2006 Pages: 173-183
BOOK-CHAPTER
Recognizing treewidth-bounded graphs
Lecture notes in computer science Year: 2006 Pages: 185-192