Name
Abstract | ||
|---|---|---|
Thescore vector of a labeled digraph is the vector of out-degrees of its vertices. LetG be a finite labeled undirected graph without loops, and let σ(G) be the set of distinct score vectors arising from all possible orientations ofG. Let ϕ(G) be the set of subgraphs ofG which are forests of labeled trees. We display a bijection between σ(G) and ϕ(G). |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1007/BF02579176 | Combinatorica |
Keywords | Field | DocType |
05 C 20, 05 C 05, 05 C 30 | Discrete mathematics,Graph,Combinatorics,Bijection,Vertex (geometry),Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
1 | 1 | 1439-6912 |
Citations | PageRank | References |
7 | 1.36 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Kleitman | 1 | 854 | 277.98 |
| Kenneth J. Winston | 2 | 52 | 7.83 |