scientific article; zbMATH DE number 6857406

zbMath1383.05176MaRDI QIDQ5374244

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

extremal graphs

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Generalizing cographs to 2-cographs

Cites Work

• Unnamed Item
• Unnamed Item
• On 3-connected graphs with contractible edge covers of size \(k\)
• Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
• 3‐connected graphs with non‐cut contractible edge covers of size k
• Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three

This page was built for publication: