Generalized coloring for tree-like graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Finding approximate separators and computing tree width quicklyPublished by Association for Computing Machinery (ACM) ,1992
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985