Pages that link to "Item:Q3204040"
From MaRDI portal
The following pages link to Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees (Q3204040):
Displaying 16 items.
- An improved isomorphism test for bounded-tree-width graphs (Q5002745) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
- (Q5090449) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES (Q5248998) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Two-closure of rank \(3\) groups in polynomial time (Q6170785) (← links)
- Isomorphism Testing Parameterized by Genus and Beyond (Q6188514) (← links)
- Finding edge-disjoint paths in partial k-trees (Q6487440) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
