The Ryjáček closure and a forbidden subgraph

DOI10.7151/DMGT.1876zbMATH Open1339.05219OpenAlexW2329448020MaRDI QIDQ726640FDOQ726640

Authors: Akira Saito, Liming 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

Recommendations

• Closure concepts for claw-free graphs
• On graph closures
• Closure and forbidden pairs for Hamiltonicity
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs

zbMATH Keywords

claw-free graphclosureperfect matchingHamiltonian graphtraceable graph

Mathematics Subject Classification ID

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

Cites Work

• On a closure concept in claw-free graphs
• Graphs \& digraphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Hamiltonian results inK1,3-free graphs
• Reflections on graph theory
• On partitioning the edges of graphs into connected subgraphs
• Title not available (Why is that?)
• 1-Factors and Antifactor Sets
• Forbidden subgraphs and bounds on the size of a maximum matching

Cited In (2)

• Deficiency and forbidden subgraphs of connected, locally-connected graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726640)