On the public citation graph
A Broken-Circuits-Theorem for hypergraphs
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0012-365x(73)90040-xopenalex-snapshot
Expansions of the chromatic polynomial
inferredcites →https://doi.org/10.1090/s0002-9904-1932-05460-xopenalex-snapshot
A logical expansion in mathematics
inferredcites →https://doi.org/10.2307/1967597openalex-snapshot
A Determinant Formula for the Number of Ways of Coloring a Map
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/eujc.1999.0411openalex-snapshot
On the Number of Precolouring Extensions
inferred← citeshttps://doi.org/10.1007/bf03322239openalex-snapshot
A Contribution to The Chromatic Theory of Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s000130050336openalex-snapshot
An improvement of the inclusion-exclusion principle
inferred← citeshttps://doi.org/10.1007/s00373-009-0856-6openalex-snapshot
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1016/j.aam.2026.103067openalex-snapshot
Hopf algebraic structures on hypergraphs and multi-complexes
inferred← citeshttps://doi.org/10.1016/j.aml.2007.02.006openalex-snapshot
Chromatic polynomials of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.079openalex-snapshot
On chromaticity of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.019openalex-snapshot
Color-bounded hypergraphs, I: General results
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112134openalex-snapshot
Zero-free intervals of chromatic polynomials of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.006openalex-snapshot
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2026.104348openalex-snapshot
Polynomials counting group colorings in graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.018openalex-snapshot
On chromatic polynomials of hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1017/s1446788718000137openalex-snapshot
SYMMETRY GEOMETRY BY PAIRINGS
inferred← citeshttps://doi.org/10.1093/imrn/rnae036openalex-snapshot
Eight Times Four Bialgebras of Hypergraphs, Cointeractions, and Chromatic Polynomials
inferred← citeshttps://doi.org/10.3390/math10020193openalex-snapshot
Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs
inferred← citeshttps://doi.org/10.37236/4356openalex-snapshot
An Abstraction of Whitney's Broken Circuit Theorem
inferred← citeshttps://doi.org/10.5614/ejgta.2020.8.2.4openalex-snapshot
Problems on chromatic polynomials of hypergraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1734openalex-snapshot
A note on a broken-cycle theorem for hypergraphs
inferred← citeshttps://doi.org/10.7151/dmgt.2248openalex-snapshot
Recursion relations for chromatic coefficients for graphs and hypergraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.