scientific article; zbMATH DE number 3547324
From MaRDI portal
Publication:4121923
Cited in
(25)- Monomial bases for broken circuit complexes
- The broken-circuit complex: its structure and factorizations
- Broken circuit complexes: Factorizations and generalizations
- Connected matroids with the smallest Whitney numbers
- Binomial inequalities for chromatic, flow, and tension polynomials
- Deletion-restriction for sheaf homology of graded atomic lattices
- A logician's view of graph polynomials
- Thomas H. Brylawski (1944--2007)
- Flow polynomials of a signed graph
- On sequences of polynomials arising from graph invariants
- On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals
- Broken circuit complexes and hyperplane arrangements
- Coloring complexes and arrangements
- Semantic equivalence of graph polynomials definable in second order logic
- When does the list-coloring function of a graph equal its chromatic polynomial
- Hypergraph coloring complexes
- \( h\)-vectors of matroids and logarithmic concavity
- Bijective proofs of proper coloring theorems
- Broken circuit complexes of series-parallel networks
- Linear bounds on characteristic polynomials of matroids
- Matroid Chern-Schwartz-MacPherson cycles and Tutte activities
- Characteristic vertices of trees*
- Characteristic vertices of trees*
- Lagrangian geometry of matroids
- Curious characterizations of projective and affine geometries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121923)
