Geodesic
A note on a broken-cycle theorem for hypergraphs
Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 3, pp. 641-646

Voir la notice de l'article provenant de la source Library of Science

Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there.
Keywords: Broken-cycle Theorem, hypergraphs, cycles, chromatic polynomial, graph polynomials 
@article{DMGT_2014_34_3_a17,
     author = {Trinks, Martin},
     title = {A note on a broken-cycle theorem for hypergraphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {641--646},
     publisher = {mathdoc},
     volume = {34},
     number = {3},
     year = {2014},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a17/}
}
TY  - JOUR
AU  - Trinks, Martin
TI  - A note on a broken-cycle theorem for hypergraphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2014
SP  - 641
EP  - 646
VL  - 34
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a17/
LA  - en
ID  - DMGT_2014_34_3_a17
ER  - 
%0 Journal Article
%A Trinks, Martin
%T A note on a broken-cycle theorem for hypergraphs
%J Discussiones Mathematicae. Graph Theory
%D 2014
%P 641-646
%V 34
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a17/
%G en
%F DMGT_2014_34_3_a17
Trinks, Martin. A note on a broken-cycle theorem for hypergraphs. Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 3, pp. 641-646. http://geodesic.mathdoc.fr/item/DMGT_2014_34_3_a17/