A broken-circuits-theorem for hypergraphs
From MaRDI portal
Publication:1345852
DOI10.1007/BF01196637zbMath0813.05048OpenAlexW2029317359MaRDI QIDQ1345852
Publication date: 22 May 1995
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01196637
Related Items (15)
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Some properties of chromatic coefficients of linear uniform hypergraphs ⋮ A contribution to the chromatic theory of uniform hypergraphs ⋮ A bibliography on chromatic polynomials ⋮ On chromaticity of hypergraphs ⋮ SYMMETRY GEOMETRY BY PAIRINGS ⋮ An abstraction of Whitney's broken circuit theorem ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ A note on a broken-cycle theorem for hypergraphs ⋮ Problems on chromatic polynomials of hypergraphs ⋮ Chromatic polynomials of hypergraphs ⋮ Recursion relations for chromatic coefficients for graphs and hypergraphs ⋮ Color-bounded hypergraphs. I: General results ⋮ On the number of precolouring extensions ⋮ On chromatic polynomials of hypergraphs
Cites Work
This page was built for publication: A broken-circuits-theorem for hypergraphs
