Refining a chain theorem from matroids to internally 4-connected graphs
1
Issued Date
2025-02-01
Resource Type
ISSN
01968858
eISSN
10902074
Scopus ID
2-s2.0-85208185194
Journal Title
Advances in Applied Mathematics
Volume
163
Rights Holder(s)
SCOPUS
Bibliographic Citation
Advances in Applied Mathematics Vol.163 (2025)
Suggested Citation
Lewchalermvongs C., Ding G. Refining a chain theorem from matroids to internally 4-connected graphs. Advances in Applied Mathematics Vol.163 (2025). doi:10.1016/j.aam.2024.102802 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/102721
Title
Refining a chain theorem from matroids to internally 4-connected graphs
Author(s)
Author's Affiliation
Corresponding Author(s)
Other Contributor(s)
Abstract
Graph theory and matroid theory are interconnected with matroids providing a way to generalize and analyze the structural and independence properties within graphs. Chain theorems, vital tools in both matroid and graph theory, enable the analysis of matroid structures associated with graphs. In a significant contribution, Chun, Mayhew, and Oxley [2] established a chain theorem for internally 4-connected binary matroids, clarifying the operations involved. Our research builds upon this by specifying the matroid result to internally 4-connected graphs. The primary goal of our research is to refine this chain theorem for matroids into a chain theorem for internally 4-connected graphs, making it more accessible to individuals less acquainted with matroid theory.