A characterization of one class of graphs without 3-claws

DOI10.1134/S0081543809070074MaRDI QIDQ764728zbMATH OpenOpenAlexFDO

Authors G. M. Ermakova, Vladislav Kabanov

Publication date 14 March 2012

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0081543809070074

zbMATH Keywords

graphsubgraph3-cocliquegraph without 3-claws

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• A characterization of some graphs which do not contain 3-claws
• On graphs without 3-claws with non-clique \(\mu\)-subgraphs
• scientific article; zbMATH DE number 1532668
• Determination of the distance-regular graphs without 3-claws
• A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
• The structure of claw-free graphs
• A property of claw-free graphs
• A characterization of claw-free \(b\)-perfect graphs
• Almost claw‐free graphs
• On Hamiltonicity of 3-connected claw-free graphs

Cites work

• Distance-regular graphs with girth 3 or 4: I

Cited in

(1)

• A characterization of some graphs which do not contain 3-claws

This page was built for publication: A characterization of one class of graphs without 3-claws

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