A broken-circuits-theorem for hypergraphs
From MaRDI portal
Publication:1345852
DOI10.1007/BF01196637zbMATH Open0813.05048OpenAlexW2029317359MaRDI QIDQ1345852FDOQ1345852
Authors: Klaus Dohmen 
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
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)
