Degree constrained orientations in countable graphs (Q1010857): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 02:54, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree constrained orientations in countable graphs |
scientific article |
Statements
Degree constrained orientations in countable graphs (English)
0 references
7 April 2009
0 references
Summary: Degree constrained orientations are orientations of an (undirected) graph where the in-degree function satisfies given lower and upper bounds. For finite graphs, \textit{A. Frank} and \textit{A. Gyárfás} [``How to orient the edges of a graph?'', Combinatorics, Keszthely 1976, Colloq. Math. Soc. Janos Bolyai 18, 353--364 (1978; Zbl 0389.05035)] gave a necessary and sufficient condition for the existence of such an orientation. We extend their result to countable graphs.
0 references
degree constrained orientations
0 references
indegree function
0 references
lower bound
0 references
upper bound
0 references
countable graphs
0 references