scientific article; zbMATH DE number 2187683

zbMATH Open1066.05119MaRDI QIDQ5460880FDOQ5460880

Allen Fuller

Publication date: 20 July 2005

Title of this publication is not available (Why is that?)

Recommendations

• The structure of \(\{ K_{1,3},Z_2\}\)-free graphs
• Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs
• On connected factors in \(K_{1,3}\)-free graphs
• scientific article; zbMATH DE number 1281388
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected

zbMATH Keywords

claw-free graphforbidden subgraph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Cited In (2)

• The structure of \(\{ K_{1,3},Z_2\}\)-free graphs
• Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4

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 Q5460880)