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 50 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (Q1003668) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← links)
- Two feedback problems for graphs with bounded tree-width (Q1764384) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Generalized median graphs and applications (Q2271138) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Practical graph isomorphism. II. (Q2437295) (← links)
- Graphs whose complement and square are isomorphic (Q2449164) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Some further development on the eigensystem approach for graph isomorphism detection (Q2571822) (← links)
- Efficient Pattern Matching on Graph Patterns of Bounded Treewidth (Q2840694) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Recognizing generalized Sierpiński graphs (Q4988984) (← links)
- An improved isomorphism test for bounded-tree-width graphs (Q5002745) (← links)
