Refining a chain theorem from matroids to internally 4-connected graphs

DOI10.1016/J.AAM.2024.102802MaRDI QIDQ6655397FDOQ6655397

Authors: Chanun Lewchalermvongs, Guoli Ding 

Publication date: 23 December 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Recommendations

• A chain theorem for internally 4-connected binary matroids
• A chain theorem for matroids
• A chain theorem for 4-connected matroids
• Improving a chain theorem for triangle-free 3-connected matroids
• A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors

zbMATH Keywords

internally 4-connectedchain theoremquasi 4-connected

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40) Graph minors (05C83)

Cites Work

• Title not available (Why is that?)
• A characterization of graphs with no cube minor
• Graphs with no \(\bar{P}_7\)-minor
• Uncontractable 4-connected graphs
• An excluded minor theorem for the octahedron
• An excluded minor theorem for the Octahedron plus an edge
• Title not available (Why is that?)
• Generating weakly 4-connected matroids
• Bonds with parity constraints
• The structure of quasi 4-connected graphs
• A chain theorem for 4-connected graphs
• Strengthened chain theorems for different versions of 4-connectivity
• Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
• Constructing internally 4-connected binary matroids
• Title not available (Why is that?)

This page was built for publication: Refining a chain theorem from matroids to internally 4-connected graphs

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