Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian

DOI10.2989/16073606.2020.1752840zbMath1477.05146OpenAlexW3020996517MaRDI QIDQ5163018

Xiaojing Yang, Limning Xiong

Publication date: 8 November 2021

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2020.1752840

zbMATH Keywords

Hamiltonianforbidden subgraph(near) perfect matching

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forbidden induced subgraphs for near perfect matchings
• On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
• Paw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Minimal \(2\)-connected non-Hamiltonian claw-free graphs
• Forbidden induced subgraphs for perfect matchings
• Forbidden subgraphs for existences of (connected) 2-factors of a graph
• Forbidden subgraphs that imply 2-factors
• On a property of the class of n-colorable graphs
• Forbidden triples for perfect matchings
• On partitioning the edges of graphs into connected subgraphs
• 1-Factors and Antifactor Sets
• Some Theorems on Abstract Graphs

This page was built for publication: Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian