A blow-up construction and graph coloring

DOI10.1016/0012-365X(94)00051-JzbMath0835.05024arXivalg-geom/9401007OpenAlexW3103925361WikidataQ60145534 ScholiaQ60145534MaRDI QIDQ1901028

Paolo Aluffi

Publication date: 22 April 1996

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

Full work available at URL: https://arxiv.org/abs/alg-geom/9401007

zbMATH Keywords

graph coloringchromatic polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Euler characteristics and chromatic polynomials

Uses Software

• schubert

Cites Work

• Every planar map is four colorable. II: Reducibility
• The Tutte polynomial
• Modular elements of geometric lattices
• Theory of Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A blow-up construction and graph coloring