Generalized coloring for tree-like graphs
- 30 May 1997
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 75 (2), 135-155
- https://doi.org/10.1016/s0166-218x(96)00085-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 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
- Complement reducible graphsDiscrete Applied Mathematics, 1981