[免费ChatGPT] [DeepSeek可用网址] [PDF] arxiv.org

Betwixt and between 2-factor Hamiltonian and Perfect-Matching-Hamiltonian graphs

F Romaniello, JP Zerafa - arxiv preprint arxiv:2109.03060, 2021 - arxiv.org
A Hamiltonian graph is 2-factor Hamiltonian (2FH) if each of its 2-factors is a Hamiltonian
cycle. A similar, but weaker, property is the Perfect-Matching-Hamiltonian property (PMH …
Salvați Citați Citat de 6 ori Articole cu conținut similar Toate cele 8 versiuni Afișare ca HTML
[免费ChatGPT] [DeepSeek可用网址] [PDF] arxiv.org

An updated survey on 2-Factors of Regular Graphs

D Labbate, F Romaniello - arxiv preprint arxiv:2408.04642, 2024 - arxiv.org
arxiv:2408.04642v2 [math.CO] 15 Aug 2024 Page 1 An updated survey on 2-Factors of Regular
Graphs Domenico Labbate , Federico Romaniello Dipartimento di Matematica, Informatica ed …
Salvați Citați Articole cu conținut similar Toate cele 2 versiuni Afișare ca HTML
[免费ChatGPT] [DeepSeek可用网址] [PDF] arxiv.org

The Perfect Matching Hamiltonian property in Prism and Crossed Prism graphs

F Colangelo, F Romaniello - arxiv preprint arxiv:2411.09724, 2024 - arxiv.org
A graph $ G $ has the\emph {Perfect Matching Hamiltonian property}(or for short, $ G $ is $
PMH $) if, for each one of its perfect matchings, there is another perfect matching of $ G …
Salvați Citați Articole cu conținut similar Toate cele 2 versiuni Afișare ca HTML
[免费ChatGPT] [DeepSeek可用网址] [PDF] mtu.edu

[PDF][PDF] A survey on 2-factors of regular graphs

D Labbate, F Romaniello - pages.mtu.edu
A survey on 2-factors of regular graphs Page 1 A survey on 2-factors of regular graphs
Domenico Labbate and Federico Romaniello Abstract. A 2-factor of a graph G is a 2-regular …
Salvați Citați Articole cu conținut similar Afișare ca HTML