A characterization of 3-connected graphs containing a given graph

DOI10.1016/0095-8956(82)90077-6zbMath0465.05045OpenAlexW2030755514MaRDI QIDQ1154481

Seiya Negami

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90077-6

zbMATH Keywords

contraction

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (13)

On chains of 3-connected matroids ⋮ Hall-Type Results for 3-Connected Projective Graphs ⋮ A longest cycle version of Tutte's wheels theorem ⋮ Signed-graphic matroids with all-graphic cocircuits ⋮ Minor relations for quadrangulations on the sphere ⋮ Planar graphs with no 6-wheel minor ⋮ Partial matroid representations ⋮ The regular matroids with no 5-wheel minor ⋮ Another approach to planar cover conjecture focusing on rotation systems ⋮ A Characterization of $K_{2,4}$-Minor-Free Graphs ⋮ A Characterization of Almost-Planar Graphs ⋮ Generating 5-regular planar graphs ⋮ On the structure of 3-connected matroids and graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of 3-connected graphs containing a given graph