Covering contractible edges in 2-connected graphs

MaRDI QIDQ5374244zbMATH OpenFDO

Authors Tsz Lung Chan

Publication date 10 April 2018

Full work available at URL http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p309.pdf

zbMATH Keywords

extremal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
• scientific article; zbMATH DE number 2108141
• On 3-connected graphs with contractible edge covers of size \(k\)
• Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
• Contractible edges in 3-connected graphs

Cites work

• 3‐connected graphs with non‐cut contractible edge covers of size k
• Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
• Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three
• Graph theory
• scientific article; zbMATH DE number 38315 (Why is no real title available?)
• On 3-connected graphs with contractible edge covers of size \(k\)

Cited in

(3)

• Generalizing cographs to 2-cographs
• Contractible edges in 2-connected locally finite graphs
• Contractible and non-contractible non-edges in 2-connected graphs

This page was built for publication: Covering contractible edges in 2-connected graphs

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