The Ryjáček closure and a forbidden subgraph

DOI10.7151/dmgt.1876zbMath1339.05219OpenAlexW2329448020MaRDI QIDQ726640

Akira Saito, Limning Xiong

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1876

zbMATH Keywords

claw-free graphHamiltonian graphperfect matchingclosuretraceable graph

Mathematics Subject Classification ID

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)

Related Items (1)

Deficiency and forbidden subgraphs of connected, locally-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On a closure concept in claw-free graphs
• Hamiltonian results inK1,3-free graphs
• On partitioning the edges of graphs into connected subgraphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• 1-Factors and Antifactor Sets
• Reflections on graph theory
• Forbidden subgraphs and bounds on the size of a maximum matching

This page was built for publication: The Ryjáček closure and a forbidden subgraph