The matching number and Hamiltonicity of graphs
From MaRDI portal
Publication:4956236
DOI10.1080/09728600.2020.1769416zbMATH Open1468.05231arXiv2001.00992OpenAlexW3037235827MaRDI QIDQ4956236
Author name not available (Why is that?)
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Abstract: The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.
Full work available at URL: https://arxiv.org/abs/2001.00992
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
Related Items (4)
Title not available (Why is that?) ⋮ On the number of matchings of graphs formed by a graph operation ⋮ Title not available (Why is that?) ⋮ Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
This page was built for publication: The matching number and Hamiltonicity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956236)
