How is a chordal graph like a supersolvable binary matroid?

DOI10.1016/j.disc.2004.08.004zbMath1057.05021arXivmath/0212099OpenAlexW2151201250MaRDI QIDQ704292

Sulamita Klein, David L. Forge, Raul Cordovil

Publication date: 13 January 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0212099

zbMATH Keywords

Chordal graphsBinary matroidsCliquesSupersolvable matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

Supersolvable saturated matroids and chordal graphs ⋮ Chordal matroids arising from generalized parallel connections ⋮ Dirac's theorem on simplicial matroids ⋮ A characterization of signed graphs with generalized perfect elimination orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• On the cycle polytope of a binary matroid
• T-uniqueness of some families of \(k\)-chordal matroids
• Supersolvable lattices
• Binary Supersolvable Matroids and Modular Constructions
• Modular Constructions for Combinatorial Geometries
• Theory of Matroids

This page was built for publication: How is a chordal graph like a supersolvable binary matroid?