Forbidden pairs for spanning (closed) trails

DOI10.1016/J.DISC.2017.01.009zbMath1357.05105OpenAlexW2586990530MaRDI QIDQ512584

Sheng-mei Lv, Limning Xiong

Publication date: 27 February 2017

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

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

zbMATH Keywords

forbidden subgraphstraceablesuper-Eulerian graphspanning trail

Mathematics Subject Classification ID

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

Related Items (8)

Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Erratum to: ``Forbidden pairs for spanning (closed) trails ⋮ Forbidden subgraphs for supereulerian and Hamiltonian graphs ⋮ Pairs of forbidden subgraphs and 2-connected supereulerian 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 subgraphs and Hamiltonian properties and graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Minimal \(2\)-connected non-Hamiltonian claw-free graphs
• Supereulerian graphs and excluded induced minors
• A reduction method to find spanning Eulerian subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forbidden pairs for spanning (closed) trails