Degree constrained orientations in countable graphs.
Bernáth, Attila; Bruhn, Henning
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper R122, 11 p.-Research Paper R122, 11 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBernáth, Attila, and Bruhn, Henning. "Degree constrained orientations in countable graphs.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R122, 11 p.-Research Paper R122, 11 p.. <http://eudml.org/doc/117271>.
@article{Bernáth2008,
author = {Bernáth, Attila, Bruhn, Henning},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {degree constrained orientations; indegree function; lower bound; upper bound; countable graphs},
language = {eng},
number = {1},
pages = {Research Paper R122, 11 p.-Research Paper R122, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Degree constrained orientations in countable graphs.},
url = {http://eudml.org/doc/117271},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Bernáth, Attila
AU - Bruhn, Henning
TI - Degree constrained orientations in countable graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R122, 11 p.
EP - Research Paper R122, 11 p.
LA - eng
KW - degree constrained orientations; indegree function; lower bound; upper bound; countable graphs
UR - http://eudml.org/doc/117271
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.