scientific article; zbMATH DE number 2076929

MaRDI QIDQ4470355zbMATH OpenFDO

Authors L. William Kazmierczak, F. T. Boesch, Charles L. Suffel, Daniel J. Gross

Publication date 22 June 2004

zbMATH Keywords

connectivityregular graphvulnerability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• Forbidden subgraphs in connected graphs
• Forbidden subgraphs and forbidden substructures
• Forbidden subgraphs and graph decomposition
• scientific article; zbMATH DE number 734480
• Forbidding and enforcing on graphs
• Forbidden subgraphs in the norm graph
• Forbidden subgraphs and weak locally connected graphs
• Forbidden Induced Subgraphs for Toughness
• Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
• scientific article; zbMATH DE number 270251

Cited in

(3)

• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• On the connectivity of diamond-free graphs
• Realizability results involving two connectivity parameters.

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