Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- 1 December 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (4) , 631-643
- https://doi.org/10.1016/0196-6774(90)90013-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973