Forbidden subgraphs and the existence of a 2-walk

DOI10.1016/J.DISC.2014.06.013MaRDI QIDQ400402zbMATH OpenOpenAlexFDO

Authors Michitaka Furuya

Publication date 21 August 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.06.013

zbMATH Keywords

toughnessforbidden subgraph\(k\)-walk2-walk

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Forbidden subgraphs and the existence of a 2-factor
• Two forbidden subgraphs and the existence of a 2-factor in graphs
• Forbidden subgraphs for existences of (connected) 2-factors of a graph
• Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
• scientific article; zbMATH DE number 4101231
• Forbidden subgraphs and forbidden substructures
• scientific article; zbMATH DE number 1185308
• Forbidden subgraphs that imply 2-factors
• Forbidden subgraphs in connected graphs
• Pairs and triples of forbidden subgraphs and the existence of a 2-factor

Cites work

• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• scientific article; zbMATH DE number 2104724 (Why is no real title available?)
• 2-walks in circuit graphs
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden Induced Subgraphs for Toughness
• Forbidden induced subgraphs for star-free graphs
• Graph theory
• Toughness, trees, and walks

Cited in

(2)

• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs

This page was built for publication: Forbidden subgraphs and the existence of a 2-walk

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