Reconfiguring vertex colourings of 2-trees

DOI10.26493/1855-3974.1813.7AEMaRDI QIDQ5217099zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

2-treesgraph colouringGray codesHamilton cyclesreconfiguration problems

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Gray code numbers for graphs
• Reconfiguring k-colourings of complete bipartite graphs
• Chromaticity of two-trees
• The canonical coloring graphs of trees and cycles
• Mixing colourings in 2K₂-free graphs

Cites work

• 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
• scientific article; zbMATH DE number 3733976 (Why is no real title available?)
• scientific article; zbMATH DE number 3641471 (Why is no real title available?)
• 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 \(k\)-dominating graph
• The canonical coloring graphs of trees and cycles
• The Firefighter problem: a survey of results, directions and questions

Cited in

(7)

• Reconfiguration graphs for dominating sets
• Hamilton paths in dominating graphs of trees and cycles
• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
• Gray code numbers for graphs
• scientific article; zbMATH DE number 20509 (Why is no real title available?)
• Reconfiguring k-colourings of complete bipartite graphs
• Oriented colorings of partial 2-trees

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)