Pairs of forbidden subgraphs and 2-connected supereulerian graphs

DOI10.1016/j.disc.2018.03.009zbMath1384.05104OpenAlexW2794743294MaRDI QIDQ1744755

Kiyoshi Yoshimoto, Kenta Ozeki, Roman Čada, Limning Xiong

Publication date: 19 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cycleforbidden subgraphclaw-freesupereulerian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Forbidden subgraphs for supereulerian and Hamiltonian graphs ⋮ Forbidden subgraphs and weak locally connected graphs ⋮ Forbidden subgraphs for collapsible graphs and supereulerian graphs

Cites Work

• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Forbidden pairs for spanning (closed) trails
• How many conjectures can you stand? A survey
• Forbidden subgraphs, stability and hamiltonicity
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Forbidden triples for Hamiltonicity
• Erratum to: ``Forbidden pairs for spanning (closed) trails
• Closure operation for even factors on claw-free graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Forbidden triples implying Hamiltonicity: for all graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pairs of forbidden subgraphs and 2-connected supereulerian graphs