Reconfiguring vertex colourings of 2-trees
From MaRDI portal
Publication:5217099
Recommendations
Cites work
- scientific article; zbMATH DE number 3733976 (Why is no real title available?)
- scientific article; zbMATH DE number 3641471 (Why is no real title available?)
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Connectedness of the graph of vertex-colourings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Graph theory
- Gray code numbers for graphs
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- On the complexity of reconfiguration problems
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Reconfiguration of list edge-colorings in a graph
- Reconfiguring \(k\)-colourings of complete bipartite graphs
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- The Firefighter problem: a survey of results, directions and questions
- The \(k\)-dominating graph
- The canonical coloring graphs of trees and cycles
Cited in
(7)- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
- Oriented colorings of partial 2-trees
- Reconfiguration graphs for dominating sets
- scientific article; zbMATH DE number 20509 (Why is no real title available?)
- Reconfiguring \(k\)-colourings of complete bipartite graphs
- Gray code numbers for graphs
- Hamilton paths in dominating graphs of trees and cycles
This page was built for publication: Reconfiguring vertex colourings of 2-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217099)