A note on a broken-cycle theorem for hypergraphs

DOI10.7151/dmgt.1734zbMath1305.05106arXiv1209.5069OpenAlexW2592808828MaRDI QIDQ2509555

Martin Trinks

Publication date: 28 July 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

cycleshypergraphschromatic polynomialgraph polynomialsbroken-cycle theorem

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Inclusion-exclusion by ordering-free cancellation ⋮ Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II ⋮ An abstraction of Whitney's broken circuit theorem ⋮ A broken cycle theorem for the restrained chromatic function ⋮ Recursion relations for chromatic coefficients for graphs and hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the notion of cycles in hypergraphs
• A broken-circuits-theorem for hypergraphs
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• The Coloring of Graphs
• A logical expansion in mathematics

This page was built for publication: A note on a broken-cycle theorem for hypergraphs