Geodesic
Bounded-degree graphs have arbitrarily large queue-number
Discrete mathematics & theoretical computer science, Tome 10 (2007-2008) no. 1.

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

Graphs and Algorithms 
@article{DMTCS_2008_10_1_a6,
     author = {Wood, David R.},
     title = {Bounded-degree graphs have arbitrarily large queue-number},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {2007-2008},
     doi = {10.46298/dmtcs.434},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.434/}
}
TY  - JOUR
AU  - Wood, David R.
TI  - Bounded-degree graphs have arbitrarily large queue-number
JO  - Discrete mathematics & theoretical computer science
PY  - 2007-2008
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.434/
DO  - 10.46298/dmtcs.434
LA  - en
ID  - DMTCS_2008_10_1_a6
ER  - 
%0 Journal Article
%A Wood, David R.
%T Bounded-degree graphs have arbitrarily large queue-number
%J Discrete mathematics & theoretical computer science
%D 2007-2008
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.434/
%R 10.46298/dmtcs.434
%G en
%F DMTCS_2008_10_1_a6
Wood, David R. Bounded-degree graphs have arbitrarily large queue-number. Discrete mathematics & theoretical computer science, Tome 10 (2007-2008) no. 1. doi : 10.46298/dmtcs.434. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.434/

Cité par Sources :