n-functionality of graphs

• Autorzy: Konrad Pióro
• Języki publikacji: EN

Abstrakty

EN

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.

Kategorie tematyczne

• 05C20: Directed graphs (digraphs), tournaments
• 05C78: Graph labelling (graceful graphs, bandwidth, etc.)
• 05C99: None of the above, but in this section

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Colloquium Mathematicum
• Rocznik: 2001
• Tom: 90
• Numer: 2
• Strony: 269-275

Daty

wydano

2001

Twórcy

autor

Konrad Pióro

• Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland

Identyfikatory

DOI

10.4064/cm90-2-6