scientific article; zbMATH DE number 3547324
From MaRDI portal
Publication:4121923
zbMATH Open0352.05031MaRDI QIDQ4121923FDOQ4121923
Publication date: 1976
Title of this publication is not available (Why is that?)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (25)
- Hypergraph coloring complexes
- Characteristic vertices of trees*
- Curious characterizations of projective and affine geometries
- Characteristic vertices of trees*
- Broken circuit complexes and hyperplane arrangements
- On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals
- The broken-circuit complex: its structure and factorizations
- Bijective Proofs of Proper Coloring Theorems
- Broken circuit complexes: Factorizations and generalizations
- On sequences of polynomials arising from graph invariants
- Matroid Chern-Schwartz-MacPherson cycles and Tutte activities
- \( h\)-vectors of matroids and logarithmic concavity
- Connected matroids with the smallest Whitney numbers
- Binomial inequalities for chromatic, flow, and tension polynomials
- Coloring complexes and arrangements
- Flow polynomials of a signed graph
- When does the list-coloring function of a graph equal its chromatic polynomial
- Monomial bases for broken circuit complexes
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic
- A logician's view of graph polynomials
- Lagrangian geometry of matroids
- Broken circuit complexes of series-parallel networks
- Thomas H. Brylawski (1944--2007)
- Deletion-restriction for sheaf homology of graded atomic lattices
- Linear bounds on characteristic polynomials of matroids
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)
