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