Voir la notice de l'article provenant de la source Episciences
@article{DMTCS_2005_special_250_a36, author = {D\'efossez, David}, title = {A sufficient condition for bicolorable hypergraphs}, journal = {Discrete mathematics & theoretical computer science}, publisher = {mathdoc}, volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)}, year = {2005}, doi = {10.46298/dmtcs.3427}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3427/} }
TY - JOUR AU - Défossez, David TI - A sufficient condition for bicolorable hypergraphs JO - Discrete mathematics & theoretical computer science PY - 2005 VL - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3427/ DO - 10.46298/dmtcs.3427 LA - en ID - DMTCS_2005_special_250_a36 ER -
%0 Journal Article %A Défossez, David %T A sufficient condition for bicolorable hypergraphs %J Discrete mathematics & theoretical computer science %D 2005 %V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3427/ %R 10.46298/dmtcs.3427 %G en %F DMTCS_2005_special_250_a36
Défossez, David. A sufficient condition for bicolorable hypergraphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3427. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3427/
Cité par Sources :