Circumferences of 3-connected claw-free graphs

DOI10.1016/J.DISC.2016.01.018zbMath1333.05158OpenAlexW2277080743MaRDI QIDQ267172

Zhi-Hong Chen

Publication date: 8 April 2016

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

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

zbMATH Keywords

claw-free graphcircumferenceclosed trailcollapsible graphdominating closed trailsupereulerian graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (1)

Circumferences of 3-connected claw-free graphs. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Fan-type conditions for spanning Eulerian subgraphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Graphs without spanning closed trails
• On dominating and spanning circuits in graphs
• On a closure concept in claw-free graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Hamiltonicity in 3-connected claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Circumferences of 3-connected claw-free graphs