Hamilton Paths in Dominating Graphs of Trees and Cycles
- 15 October 2022
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (6) , 1-9
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (NSF-HDR-1500481)
This publication has 9 references indexed in Scilit:
- Combinatorial Gray Codes — an Updated SurveyThe Electronic Journal of Combinatorics, 2023
- Research Trends in Graph Theory and Applications2021
- Reconfiguring vertex colourings of 2-treesArs Mathematica Contemporanea, 2019
- Introduction to ReconfigurationAlgorithms, 2018
- Reconfiguring k-colourings of Complete Bipartite GraphsKyungpook mathematical journal, 2016
- The k-Dominating GraphGraphs and Combinatorics, 2013
- Gray code numbers for graphsArs Mathematica Contemporanea, 2011
- Graph Theory2008
- Minimal change list for Lucas strings and some graph theoretic consequencesTheoretical Computer Science, 2005