Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
Let G be a graph of even order and let KG be the complete graph on the same vertex set of G. A pairing of a graph G is a perfect matching of the graph KG. A graph G has the Pairing-Hamiltonian property (for short, the PH-property) if for each one of its pairings, there exists a perfect matching of G...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier B.V.
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |