n-functionality of graphs

Konrad Pióro. "n-functionality of graphs." Colloquium Mathematicae 90.2 (2001): 269-275. <http://eudml.org/doc/283777>.

@article{KonradPióro2001,
abstract = {We first characterize in a simple combinatorial way all finite graphs whose edges can be directed to form an n-functional digraph, for a fixed positive integer n. Next, we prove that the possibility of directing the edges of an infinite graph to form an n-functional digraph depends on its finite subgraphs only. These results generalize Ore's result for functional digraphs.},
author = {Konrad Pióro},
journal = {Colloquium Mathematicae},
keywords = {graph orientation; functional digraph; vertex outdegree},
language = {eng},
number = {2},
pages = {269-275},
title = {n-functionality of graphs},
url = {http://eudml.org/doc/283777},
volume = {90},
year = {2001},
}

TY - JOUR
AU - Konrad Pióro
TI - n-functionality of graphs
JO - Colloquium Mathematicae
PY - 2001
VL - 90
IS - 2
SP - 269
EP - 275
AB - We first characterize in a simple combinatorial way all finite graphs whose edges can be directed to form an n-functional digraph, for a fixed positive integer n. Next, we prove that the possibility of directing the edges of an infinite graph to form an n-functional digraph depends on its finite subgraphs only. These results generalize Ore's result for functional digraphs.
LA - eng
KW - graph orientation; functional digraph; vertex outdegree
UR - http://eudml.org/doc/283777
ER -