The matching number and Hamiltonicity of graphs
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.
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-09-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/09728600.2020.1769416 |
id |
doaj-5bd04028d0bb4b14ae03d95e111db98e |
---|---|
record_format |
Article |
spelling |
doaj-5bd04028d0bb4b14ae03d95e111db98e2020-12-17T12:50:43ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742020-09-011731094109510.1080/09728600.2020.17694161769416The matching number and Hamiltonicity of graphsRao Li0University of South Carolina AikenThe 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.http://dx.doi.org/10.1080/09728600.2020.1769416matching numberhamiltonicity |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Rao Li |
spellingShingle |
Rao Li The matching number and Hamiltonicity of graphs AKCE International Journal of Graphs and Combinatorics matching number hamiltonicity |
author_facet |
Rao Li |
author_sort |
Rao Li |
title |
The matching number and Hamiltonicity of graphs |
title_short |
The matching number and Hamiltonicity of graphs |
title_full |
The matching number and Hamiltonicity of graphs |
title_fullStr |
The matching number and Hamiltonicity of graphs |
title_full_unstemmed |
The matching number and Hamiltonicity of graphs |
title_sort |
matching number and hamiltonicity of graphs |
publisher |
Taylor & Francis Group |
series |
AKCE International Journal of Graphs and Combinatorics |
issn |
0972-8600 2543-3474 |
publishDate |
2020-09-01 |
description |
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. |
topic |
matching number hamiltonicity |
url |
http://dx.doi.org/10.1080/09728600.2020.1769416 |
work_keys_str_mv |
AT raoli thematchingnumberandhamiltonicityofgraphs AT raoli matchingnumberandhamiltonicityofgraphs |
_version_ |
1724379820205277184 |