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

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Article number102802
JournalAdvances in Applied Mathematics
Volume163
DOIs
Publication statusPublished - Feb 2025
Externally publishedYes

Keywords

  • Chain theorem
  • Internally 4-connected
  • Quasi 4-connected

Fingerprint

Dive into the research topics of 'Refining a chain theorem from matroids to internally 4-connected graphs'. Together they form a unique fingerprint.

Cite this