Chordal matroids arising from generalized parallel connections. II
DOI10.1016/J.AAM.2024.102833MaRDI QIDQ6665419
James Oxley, James Dylan Douthitt
Publication date: 17 January 2025
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) General theory of linear incidence geometry and projective geometries (51A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- How is a chordal graph like a supersolvable binary matroid?
- On rigid circuit graphs
- Minors of 3-connected matroids
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Triangulated graphs and the elimination process
- Matroids and Graphs
- Chordal matroids arising from generalized parallel connections
This page was built for publication: Chordal matroids arising from generalized parallel connections. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665419)
