Pages that link to "Item:Q1345852"
From MaRDI portal
The following pages link to A broken-circuits-theorem for hypergraphs (Q1345852):
Displaying 16 items.
- An abstraction of Whitney's broken circuit theorem (Q470960) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- On chromaticity of hypergraphs (Q878636) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- On the number of precolouring extensions (Q1590211) (← links)
- A contribution to the chromatic theory of uniform hypergraphs (Q1896647) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Recursion relations for chromatic coefficients for graphs and hypergraphs (Q2062676) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- A note on a broken-cycle theorem for hypergraphs (Q2509555) (← links)
- On chromatic polynomials of hypergraphs (Q3439420) (← links)
- Problems on chromatic polynomials of hypergraphs (Q4957990) (← links)
- SYMMETRY GEOMETRY BY PAIRINGS (Q5379026) (← links)
- Chromatic polynomials of hypergraphs (Q5920448) (← links)
- Coloring rings (Q6055414) (← links)