Contractibility techniques as a closure concept

DOI10.1002/JGT.10103MaRDI QIDQ4808405zbMATH OpenOpenAlexFDO

Authors Zdeněk Ryjáček, R. H. Schelp

Publication date 22 May 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10103

zbMATH Keywords

circumferenceclaw-free graphclosurecollapsible graphcontractible graphHamiltonian graphline graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph theory (05C99)

Recommendations

• The \(*\)-closure for graphs and claw-free graphs
• Closure concepts for claw-free graphs
• Strengthening the closure concept in claw-free graphs
• On graph closures
• Closure concept for 2-factors in claw-free graphs

Cited in

(16)

• Contractions of closure systems
• A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
• Systematization of a set of closure techniques
• Closure operation for even factors on claw-free graphs
• The edge-closure of a claw-free graph is the line graph of a multigraph.
• Stability of hereditary graph classes under closure operations
• Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
• scientific article; zbMATH DE number 861437 (Why is no real title available?)
• Hamilton‐connected {claw,net}‐free graphs, II
• Hamilton‐connected {claw, net}‐free graphs, I
• How many conjectures can you stand? A survey
• Every 4-connected \{claw, hourglass\}-free graph is 2-Hamiltonian
• Closure concept for 2-factors in claw-free graphs
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• The \(*\)-closure for graphs and claw-free graphs
• Degree conditions on induced claws

This page was built for publication: Contractibility techniques as a closure concept

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