![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Let G = (V (G), E(G)) be a graph. A set M ⊆ E(G) is a matching if no two edges in M share a common vertex. A matching of G is perfect if it covers every vertex in G. A matching of a graph G with odd order is called a near perfect matching if it has 
edges. In this paper, we completely characterize the forbidden subgraph and pairs of forbidden subgraphs that force a 2-connected graph with a (near) perfect matching to be hamiltonian.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
