Equitable colorings of bounded treewidth graphs
- 1 December 2005
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 349 (1), 22-30
- https://doi.org/10.1016/j.tcs.2005.09.027
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of GraphsJournal of Algorithms, 1996
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- Equitable and m-bounded coloring of split graphsLecture Notes in Computer Science, 1996
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Equitable Coloring of TreesJournal of Combinatorial Theory, Series B, 1994
- NP-Completeness of graph decomposition problemsJournal of Complexity, 1991
- A note on the decomposition of graphs into isomorphic matchingsActa Mathematica Hungarica, 1983
- Equitable and proportional coloring of treesJournal of Combinatorial Theory, Series B, 1983