scientific article; zbMATH DE number 238370

MaRDI QIDQ5287814zbMATH OpenFDO

Authors Guojun Li

Publication date 19 September 1993

zbMATH Keywords

claw-free graphslongest cyclelongest path

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Longest cycles in regular 2-connected claw-free graphs
• Circumferences of regular claw-free graphs
• scientific article; zbMATH DE number 147641
• scientific article; zbMATH DE number 1150168
• Circumferences of 3-connected claw-free graphs. II.

Cited in

(10)

• Longest cycles in regular graphs
• Longest cycles in regular 2-connected claw-free graphs
• Circumferences of regular claw-free graphs
• scientific article; zbMATH DE number 4212091 (Why is no real title available?)
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• scientific article; zbMATH DE number 94049 (Why is no real title available?)
• scientific article; zbMATH DE number 147641 (Why is no real title available?)
• scientific article; zbMATH DE number 1150168 (Why is no real title available?)
• scientific article; zbMATH DE number 205838 (Why is no real title available?)
• Connectivity and cycles in graphs

This page was built for publication:

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