Reconfiguring vertex colourings of 2-trees
From MaRDI portal
Publication:5217099
DOI10.26493/1855-3974.1813.7AEzbMATH Open1433.05112OpenAlexW2995405989WikidataQ126564355 ScholiaQ126564355MaRDI QIDQ5217099FDOQ5217099
Authors: K. Seyffarth, M. 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
Recommendations
Cites Work
- Graph theory
- The \(k\)-dominating graph
- Connectedness of the graph of vertex-colourings
- The canonical coloring graphs of trees and cycles
- Gray code numbers for graphs
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- The Firefighter problem: a survey of results, directions and questions
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- On the complexity of reconfiguration problems
- Reconfiguration of list edge-colorings in a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- Reconfiguring \(k\)-colourings of complete bipartite graphs
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
- Title not available (Why is that?)
- 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)
