A new method of proving theorems on chromatic index

A. Ehrenfeucht; V. Faber; H. A. Kierstead

doi:10.1016/0012-365X(84)90078-5

A new method of proving theorems on chromatic index

A. Ehrenfeucht, V. Faber, H. A. Kierstead

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

V.G. Vizing proved that the edge-chromatic number x₁ 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.

Original language	English (US)
Pages (from-to)	159-164
Number of pages	6
Journal	Discrete Mathematics
Volume	52
Issue number	2-3
DOIs	https://doi.org/10.1016/0012-365X(84)90078-5
State	Published - 1984
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(84)90078-5

Cite this

@article{212192a3069c4857af213f5a0d162fc9,

title = "A new method of proving theorems on chromatic index",

abstract = "V.G. Vizing proved that the edge-chromatic number x1 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.",

author = "A. Ehrenfeucht and V. Faber and Kierstead, {H. A.}",

year = "1984",

doi = "10.1016/0012-365X(84)90078-5",

language = "English (US)",

volume = "52",

pages = "159--164",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2-3",

}

TY - JOUR

T1 - A new method of proving theorems on chromatic index

AU - Ehrenfeucht, A.

AU - Faber, V.

AU - Kierstead, H. A.

PY - 1984

Y1 - 1984

N2 - V.G. Vizing proved that the edge-chromatic number x1 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.

AB - V.G. Vizing proved that the edge-chromatic number x1 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.

UR - http://www.scopus.com/inward/record.url?scp=0039579480&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039579480&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(84)90078-5

DO - 10.1016/0012-365X(84)90078-5

M3 - Article

AN - SCOPUS:0039579480

SN - 0012-365X

VL - 52

SP - 159

EP - 164

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2-3

ER -

A new method of proving theorems on chromatic index

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this