Reconfiguring vertex colourings of 2-trees
From MaRDI portal
Publication:5217099
DOI10.26493/1855-3974.1813.7aezbMath1433.05112OpenAlexW2995405989WikidataQ126564355 ScholiaQ126564355MaRDI QIDQ5217099
Karen Seyffarth, Michael S. Cavers
Publication date: 21 February 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1813.7ae
Related Items (3)
Reconfiguration graphs for dominating sets ⋮ Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs ⋮ Hamilton paths in dominating graphs of trees and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of reconfiguration problems
- Reconfiguration of list edge-colorings in a graph
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- The \(k\)-dominating graph
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- Connectedness of the graph of vertex-colourings
- The canonical coloring graph of trees and cycles
- Gray code numbers for graphs
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Reconfiguring k-colourings of Complete Bipartite Graphs
This page was built for publication: Reconfiguring vertex colourings of 2-trees