Properly 3-contractible edges in a minimally 3-connected graph

DOI10.1016/J.DISC.2023.113321MaRDI QIDQ2689494zbMATH OpenOpenAlexFDO

Authors Kiyoshi Ando, Yoshimi Egawa

Publication date 10 March 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2023.113321

zbMATH Keywords

edge contractionminimally 3-connected graphproperly 3-contractible edges

Mathematics Subject Classification ID

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

Recommendations

• Contractible edges in 3-connected graphs
• scientific article; zbMATH DE number 4043878
• scientific article; zbMATH DE number 2108141
• Contractible edges in 3-connected graphs that preserve a minor
• Contractible edges and contractible triangles in a 3-connected graph
• Contractible non-edges in \(3\)-connected graphs
• scientific article; zbMATH DE number 4202289
• The number of contractible edges in 3-connected graphs
• Contractible Edges in 3-Connected Cubic Graphs
• An included-minor result for 3-connected graphs with contractible edges

Cites work

• A theorem on n-connected graphs
• Contractible edges and contractible triangles in a 3-connected graph
• Contractible edges in 3-connected graphs
• Contractible edges in 3-connected graphs that preserve a minor
• Contractible edges in triangle-free graphs
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• The number of contractible edges in 3-connected graphs
• The number of vertices of degree 5 in a contraction-critically 5-connected graph

Cited in

(10)

• Minimally 3-restricted edge connected graphs
• On minimally 3-connected graphs on a surface
• The 3-connected graphs with exactly three non-essential edges
• An included-minor result for 3-connected graphs with contractible edges
• scientific article; zbMATH DE number 4202289 (Why is no real title available?)
• scientific article; zbMATH DE number 2108141 (Why is no real title available?)
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• On r-connected graphs with no semi-topological r-wheel
• Contractible Edges in 3-Connected Cubic Graphs
• Contractible edges in spanning trees of 3-connected graphs

This page was built for publication: Properly 3-contractible edges in a minimally 3-connected graph

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