$n$-functionality of graphs
Colloquium Mathematicum, Tome 90 (2001) no. 2, pp. 269-275
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
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.
Keywords:
first characterize simple combinatorial finite graphs whose edges directed form n functional digraph fixed positive integer prove possibility directing edges infinite graph form n functional digraph depends its finite subgraphs only these results generalize ores result functional digraphs
Affiliations des auteurs :
Konrad Pi/oro  1
@article{10_4064_cm90_2_6,
author = {Konrad Pi/oro},
title = {$n$-functionality of graphs},
journal = {Colloquium Mathematicum},
pages = {269--275},
year = {2001},
volume = {90},
number = {2},
doi = {10.4064/cm90-2-6},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/cm90-2-6/}
}
Konrad Pi/oro. $n$-functionality of graphs. Colloquium Mathematicum, Tome 90 (2001) no. 2, pp. 269-275. doi: 10.4064/cm90-2-6
Cité par Sources :