Hamilton-connected claw-free graphs with Ore-degree conditions

DOI10.1016/j.dam.2023.08.002zbMath1526.05084MaRDI QIDQ6069157

Xia Liu, Hong-Jian Lai

Publication date: 13 November 2023

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

zbMATH Keywords

claw-free graphcollapsible graphHamilton-connected graphstrongly dominating trailable graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• Hamiltonian connected claw-free graphs
• Graphs without spanning closed trails
• A nine point theorem for 3-connected graphs
• On a closure concept in claw-free graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Chvátal-Erdős conditions and almost spanning trails
• Cycles containing 12 vertices in 3-connected cubic graphs
• Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
• Hamilton‐connected {claw, net}‐free graphs, I

This page was built for publication: Hamilton-connected claw-free graphs with Ore-degree conditions