Circumferences of 3-connected claw-free graphs

DOI10.1016/J.DISC.2016.01.018zbMATH Open1333.05158OpenAlexW2277080743MaRDI QIDQ267172FDOQ267172

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1766873
• Circumferences of 3-connected claw-free graphs. II.
• On the circumference of 3-connected quasi-claw-free graphs
• scientific article; zbMATH DE number 147639
• scientific article; zbMATH DE number 1766878
• Circumferences of claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• Circumferences in \(k\)-connected claw-free graphs
• Circumferences of regular claw-free graphs

zbMATH Keywords

circumferenceclaw-free graphclosed trailcollapsible graphdominating closed trailsupereulerian graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• 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
• Title not available (Why is that?)
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Some Theorems on Abstract Graphs
• Fan-type conditions for spanning Eulerian subgraphs

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On 2-factors with long cycles in 3-connected claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Title not available (Why is that?)
• Circumferences in \(k\)-connected claw-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• Circumferences of regular claw-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267172)