A broken-circuits-theorem for hypergraphs
From MaRDI portal
Recommendations
- A note on a broken-cycle theorem for hypergraphs
- On the broken-circuit complex of graphs
- Broken circuit complexes and hyperplane arrangements
- Broken circuits in matroids -- Dohmen's inductive proof
- scientific article; zbMATH DE number 1522768
- Hypergraphs of Bounded Disjointness
- A Harary-Sachs theorem for hypergraphs
- A hypergraph version of the Gallai-Edmonds Theorem
- Mathematical Foundations of Computer Science 2005
- Circuit decompositions and shortest circuit coverings of hypergraphs
Cites work
Cited in
(16)- A note on a broken-cycle theorem for hypergraphs
- Problems on chromatic polynomials of hypergraphs
- Some properties of chromatic coefficients of linear uniform hypergraphs
- A bibliography on chromatic polynomials
- Zero-free intervals of chromatic polynomials of hypergraphs
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Coloring rings
- Chromatic polynomials of hypergraphs
- Color-bounded hypergraphs. I: General results
- An abstraction of Whitney's broken circuit theorem
- A contribution to the chromatic theory of uniform hypergraphs
- Symmetry geometry by pairings
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- On chromatic polynomials of hypergraphs
- On chromaticity of hypergraphs
- On the number of precolouring extensions
This page was built for publication: A broken-circuits-theorem for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345852)
