A twelve vertex theorem for 3-connected claw-free graphs

DOI10.1007/S00373-015-1608-4zbMATH Open1338.05147OpenAlexW833127892MaRDI QIDQ292255FDOQ292255

Authors: Zhi-Hong Chen 

Publication date: 13 June 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1608-4

Recommendations

• A nine vertex theorem for 3-connected claw- free graphs
• Vizing's conjecture: A two-thirds bound for claw-free graphs
• On the connectivity and matchings in 3-vertex-critical claw-free graphs
• scientific article; zbMATH DE number 1766878
• scientific article; zbMATH DE number 5179133
• \(Z_3\)-connectivity of claw-free graphs
• On Hamiltonicity of 3-connected claw-free graphs
• scientific article; zbMATH DE number 7274067
• Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
• The structure of claw-free graphs

zbMATH Keywords

line graphsclaw-free graphscyclabilityEulerian subgraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On a closure concept in claw-free graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• A look at cycles containing specified elements of a graph
• A nine point theorem for 3-connected graphs
• Cycles through 23 vertices in 3-connected cubic planar graphs
• Cycles through ten vertices in 3-connected cubic graphs
• Cycles containing 12 vertices in 3-connected cubic graphs
• A nine vertex theorem for 3-connected claw- free graphs
• Title not available (Why is that?)
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• The \(*\)-closure for graphs and claw-free graphs

Cited In (3)

• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• A nine vertex theorem for 3-connected claw- free graphs
• Cycle traversability for claw-free graphs and polyhedral maps

This page was built for publication: A twelve vertex theorem for 3-connected claw-free graphs

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