Name
Abstract | ||
|---|---|---|
V.G. Vizing proved that the edge-chromatic number x 1 of any multigraph M with maximum degree Δ( M ) and maximum multiplicity μ( M ) is Δ ( M )+ μ ( M ). In this paper we present a new method for proving this and other related results that are due to Gol'dberg, Anderson, Ore, Shannon, and Vizing. In our proofs we replace arguments about ‘fan sequences’ with counting arguments. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0012-365X(84)90078-5 | DISCRETE MATHEMATICS |
Keywords | Field | DocType |
indexation | Discrete mathematics,Edge coloring,Combinatorics,Multigraph,Multiplicity (mathematics),Mathematical proof,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
52 | 2-3 | 0012-365X |
Citations | PageRank | References |
13 | 2.58 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| V. Faber | 2 | 13 | 2.58 |
| H.A. Kierstead | 3 | 37 | 5.54 |