Extending perfect matchings to Hamiltonian cycles in line graphs (Q2223459)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7303530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extending perfect matchings to Hamiltonian cycles in line graphs |
scientific article; zbMATH DE number 7303530 |
Statements
Extending perfect matchings to Hamiltonian cycles in line graphs (English)
0 references
29 January 2021
0 references
Summary: A graph admitting a perfect matching has the Perfect-Matching-Hamiltonian property (for short the PMH-property) if each of its perfect matchings can be extended to a Hamiltonian cycle. In this paper we establish some sufficient conditions for a graph \(G\) in order to guarantee that its line graph \(L(G)\) has the PMH-property. In particular, we prove that this happens when \(G\) is (i) a Hamiltonian graph with maximum degree at most \(3\), (ii) a complete graph, or (iii) an arbitrarily traceable graph. Further related questions and open problems are proposed along the paper.
0 references
perfect-matching-Hamiltonian property
0 references
0.7760494351387024
0 references
0.775911808013916
0 references
0.7708063125610352
0 references
0.7698397636413574
0 references
