Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
From MaRDI portal
(Redirected from Publication:3204040)
Recommendations
Cited in
(71)- Approximability of partitioning graphs with supply and demand
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Complexity of path-forming games
- Algorithms for generalized vertex-rankings of partial k-trees
- Faster algorithms for subgraph isomorphism of k-connected partial k-trees
- Counting \(H-\)colorings of partial \(k-\)trees
- The QAP-polytope and the graph isomorphism problem
- Polynomial time algorithms for variants of graph matching on partial k-trees
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Two feedback problems for graphs with bounded tree-width
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Cleaning interval graphs
- Revising Johnson's table for the 21st century
- Classical symmetries and the quantum approximate optimization algorithm
- Complexity-separating graph classes for vertex, edge and total colouring
- Colored hypergraph isomorphism is fixed parameter tractable
- Chromatic index of graphs with no cycle with a unique chord
- Generalized median graphs and applications
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
- Practical graph isomorphism. II.
- Graphs whose complement and square are isomorphic
- Algorithms for finding distance-edge-colorings of graphs
- Line graphs of bounded clique-width
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- Tree decomposition and discrete optimization problems: a survey
- Vertex disjoint paths on clique-width bounded graphs
- Exact algorithms for intervalizing coloured graphs
- Some further development on the eigensystem approach for graph isomorphism detection
- Efficient pattern matching on graph patterns of bounded treewidth
- Fixed-parameter tractability of treewidth and pathwidth
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Graphs of bounded treewidth can be canonized in AC^1
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Subexponential time algorithms for finding small tree and path decompositions
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- scientific article; zbMATH DE number 4062614 (Why is no real title available?)
- Edge-colouring and total-colouring chordless graphs
- On the complexity of graph reconstruction
- Confronting intractability via parameters
- Recognizing generalized Sierpiński graphs
- An improved isomorphism test for bounded-tree-width graphs
- Fast Algorithms for Join Operations on Tree Decompositions
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
- A parallel algorithm for edge-coloring partial k-trees
- Algorithmic data science (invited talk)
- A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- The Space Complexity of k-Tree Isomorphism
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- Computational complexity of computing symmetries in finite-domain planning
- Canonisation and Definability for Graphs of Bounded Rank Width
- Graph isomorphism restricted by lists
- Two-closure of rank \(3\) groups in polynomial time
- Isomorphism Testing Parameterized by Genus and Beyond
- Finding edge-disjoint paths in partial k-trees
- Constraint satisfaction, graph isomorphism, and the pebbling comonad
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
- Graph isomorphism in quasipolynomial time parameterized by treewidth
- Monadic second-order evaluations on tree-decomposable graphs
- Fast algorithms for Vizing's theorem on bounded degree graphs
- Isomorphism testing for graphs excluding small topological subgraphs
- The isomorphism problem for \(k\)-trees is complete for logspace
- Restricted space algorithms for isomorphism on bounded treewidth graphs
- The isomorphism problem of power graphs and a question of Cameron
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Partitioning graphs of supply and demand
- Parameterized graph cleaning problems
- Efficient frequent connected subgraph mining in graphs of bounded tree-width
This page was built for publication: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204040)
