Geodesic
The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree
Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 2.

Voir la notice de l'article provenant de la source Episciences

Discrete Algorithms 
@article{DMTCS_2013_15_2_a2,
     author = {Szyma\'nska, Edyta},
     title = {The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {2013},
     doi = {10.46298/dmtcs.596},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.596/}
}
TY  - JOUR
AU  - Szymańska, Edyta
TI  - The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree
JO  - Discrete mathematics & theoretical computer science
PY  - 2013
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.596/
DO  - 10.46298/dmtcs.596
LA  - en
ID  - DMTCS_2013_15_2_a2
ER  - 
%0 Journal Article
%A Szymańska, Edyta
%T The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree
%J Discrete mathematics & theoretical computer science
%D 2013
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.596/
%R 10.46298/dmtcs.596
%G en
%F DMTCS_2013_15_2_a2
Szymańska, Edyta. The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree. Discrete mathematics & theoretical computer science, Tome 15 (2013) no. 2. doi : 10.46298/dmtcs.596. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.596/

Cité par Sources :