Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs

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(...

Full description

Saved in:
Bibliographic Details
Published in:The Electronic journal of combinatorics 2021-01, Vol.28 (1)
Main Authors: Abreu, Marién, Gauci, John Baptist, Labbate, Domenico, Mazzuoccolo, Giuseppe, Zerafa, Jean Paul
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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, (iii) a balanced complete bipartite graph with at least 100 vertices, or (iv) an arbitrarily traceable graph. Further related questions and open problems are proposed along the paper.
ISSN:1077-8926
1077-8926
DOI:10.37236/9143