Geodesic
Degree constrained orientations in countable graphs
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Degree constrained orientations are orientations of an (undirected) graph where the in-degree function satisfies given lower and upper bounds. For finite graphs Frank and Gyárfás (1976) gave a necessary and sufficient condition for the existence of such an orientation. We extend their result to countable graphs.
DOI : 10.37236/846
Classification : 05C20
Mots-clés : degree constrained orientations, indegree function, lower bound, upper bound, countable graphs 
@article{10_37236_846,
     author = {Attila Bern\'ath and Henning Bruhn},
     title = {Degree constrained orientations in countable graphs},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/846},
     zbl = {1180.05051},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/846/}
}
TY  - JOUR
AU  - Attila Bernáth
AU  - Henning Bruhn
TI  - Degree constrained orientations in countable graphs
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/846/
DO  - 10.37236/846
ID  - 10_37236_846
ER  - 
%0 Journal Article
%A Attila Bernáth
%A Henning Bruhn
%T Degree constrained orientations in countable graphs
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/846/
%R 10.37236/846
%F 10_37236_846
Attila Bernáth; Henning Bruhn. Degree constrained orientations in countable graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/846

Cité par Sources :