Forbidden subgraphs and the existence of a 2-walk

DOI10.1016/j.disc.2014.06.013zbMath1298.05301OpenAlexW2079485979MaRDI QIDQ400402

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forbidden induced subgraphs for star-free graphs
• 2-walks in circuit graphs
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden Induced Subgraphs for Toughness
• Toughness, trees, and walks