Name
Title | ||
|---|---|---|
Alternating eulerian trails with prescribed degrees in two edge-colored complete graphs |
Abstract | ||
|---|---|---|
Let K\"n be the complete graph with vertex set {v\"1, v\"2, ..., v\"n} and let g=(g\"1, ..., g\"n) be a sequence of positive integers. Color each edge of this K\"n red or blue. In this paper necessary and sufficient conditions are given which guarantee the existence of a connected spanning subgraph F in K\"n (as colored) with both red degree and blue degree in F at vertex v\"1 equal to g\"i. When each g\"i = 1 this answers a question of Erdos proved in this special case in [1]. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0012-365X(83)90016-X | Discrete Mathematics |
Keywords | Field | DocType |
complete graph,edge coloring | Integer,Complete graph,Discrete mathematics,Graph,Combinatorics,Colored,Vertex (geometry),Eulerian path,Function composition,Mathematics,Special case | Journal |
Volume | Issue | ISSN |
43 | 1 | Discrete Mathematics |
Citations | PageRank | References |
8 | 1.65 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prabir Das | 1 | 16 | 5.20 |
| S.B. Rao | 2 | 34 | 7.37 |