Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- 1 January 1988
- book chapter
- Published by Springer Nature
- p. 223-232
- https://doi.org/10.1007/3-540-19487-8_26
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Problems easy for tree-decomposable graphs extended abstractPublished by Springer Nature ,1988
- 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 Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- 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