Hamilton paths in dominating graphs of trees and cycles

DOI10.1007/s00373-022-02579-8zbMath1502.05115arXiv2112.04448OpenAlexW4306294676MaRDI QIDQ2093102

K. V. Adaricheva, Margaret-Ellen Messinger, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Heather Smith Blake, Karen Seyffarth

Publication date: 4 November 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.04448

zbMATH Keywords

dominationreconfigurationHamilton paths

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-dominating graph
• Introduction to reconfiguration
• Minimal change list for Lucas strings and some graph theoretic consequences
• Gray code numbers for graphs
• Reconfiguring vertex colourings of 2-trees
• Reconfiguring k-colourings of Complete Bipartite Graphs

This page was built for publication: Hamilton paths in dominating graphs of trees and cycles