Geodesic
Some results on chromatic polynomials of hypergraphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper, chromatic polynomials of (non-uniform) hypercycles, unicyclic hypergraphs, hypercacti and sunflower hypergraphs are presented. The formulae generalize known results for $r$-uniform hypergraphs due to Allagan, Borowiecki/Łazuka, Dohmen and Tomescu. Furthermore, it is shown that the class of (non-uniform) hypertrees with $m$ edges, where $m_r$ edges have size $r$, $r\geq 2$, is chromatically closed if and only if $m\leq4$, $m_2\geq m-1$.
DOI : 10.37236/183
Classification : 05C15, 05C65 
@article{10_37236_183,
     author = {Manfred Walter},
     title = {Some results on chromatic polynomials of hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/183},
     zbl = {1186.05059},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/183/}
}
TY  - JOUR
AU  - Manfred Walter
TI  - Some results on chromatic polynomials of hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/183/
DO  - 10.37236/183
ID  - 10_37236_183
ER  - 
%0 Journal Article
%A Manfred Walter
%T Some results on chromatic polynomials of hypergraphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/183/
%R 10.37236/183
%F 10_37236_183
Manfred Walter. Some results on chromatic polynomials of hypergraphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/183

Cité par Sources :