Skip to main content
SpringerLink
Log in

A Broken-Circuits-Theorem for hypergraphs

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. Berge, Hypergraphs. North-Holland, Amsterdam 1989.

    Google Scholar 

  2. C. Berge, Graphs and Hypergraphs. North-Holland, Amsterdam 1973.

    Google Scholar 

  3. N. Biggs, Expansions of the chromatic polynomial. Discrete Math.6, 105–113 (1973).

    Google Scholar 

  4. G. D. Birkhoff, A determinant formula for the number of ways of coloring a map. Ann. of Math.14, 42–46 (1912).

    Google Scholar 

  5. K.Dohmen, Chromatische Polynome von Graphen und Hypergraphen. Dissertation, Universität Düsseldorf 1993.

  6. H. Whitney, A logical expansion in mathematics. Bull. Amer. Math. Soc.38, 572–579 (1932).

    Google Scholar 

Download references

Author information

Author notes

  1. Klaus Dohmen

    Present address: Fachbereich 16 - Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, D-10099, Berlin

Authors and Affiliations

    Authors
    1. Klaus Dohmen
      View author publications

      You can also search for this author in PubMed Google Scholar

    Additional information

    This paper is part of the author's doctoral dissertation written at the University of Düsseldorf under the supervision of Professor Egbert Harzheim.

    Rights and permissions

    Reprints and permissions

    About this article

    Cite this article

    Dohmen, K. A Broken-Circuits-Theorem for hypergraphs. Arch. Math 64, 159–162 (1995). https://doi.org/10.1007/BF01196637

    Download citation

    • Received:

    • Issue Date:

    • DOI: https://doi.org/10.1007/BF01196637

    Search

    Navigation