Forbidden subgraphs and weak locally connected graphs

DOI10.1007/s00373-018-1952-2zbMath1402.05129OpenAlexW2895519847WikidataQ129128514 ScholiaQ129128514MaRDI QIDQ1756128

Xia Liu, Limning Xiong, Hou-yuan Lin

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1952-2

zbMATH Keywords

2-factorHamiltonian graphsupereulerian graphforbidden subgraphcollapsible subgraph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs, Forbidden subgraphs for collapsible graphs and supereulerian graphs

Cites Work

• Forbidden pairs for spanning (closed) trails
• Graph whose edges are in small cycles
• Characterizing forbidden pairs for hamiltonian properties
• Erratum to: ``Forbidden pairs for spanning (closed) trails
• Pairs of forbidden subgraphs and 2-connected supereulerian graphs
• Supereulerian graphs and excluded induced minors
• The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
• A reduction method to find spanning Eulerian subgraphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• HamiltonianN2-locally connected claw-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item