✦ LIBER ✦

List edge colourings of some 1-factorable multigraphs

✍ Scribed by M. N. Ellingham; Luis Goddyn

Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 547 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01261320

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

List Edge and List Total Colourings of M

List Edge and List Total Colourings of Multigraphs

✍ O.V. Borodin; A.V. Kostochka; D.R. Woodall 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 425 KB

This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B 63 (1995), 153 158), who proved that the list edge chromatic number /$ list (G) of a bipartite multigraph G equals its edge chromatic number /$(G). It is now proved here that if every edge e=uw of a bipartite multigrap

Optimal Edge-Colourings for a Class of P

Optimal Edge-Colourings for a Class of Planar Multigraphs

✍ Odile Marcotte 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 387 KB

Bipartite multigraphs with 1-factors con

Bipartite multigraphs with 1-factors containing specified edges

✍ S. M. Allen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract We prove a necessary and sufficient condition for a regular bipartite multigraph to contain a 1‐factor including one specified set of independent edges and avoiding another specified set of edges. © 1995 John Wiley & Sons, Inc.

Constructing indecomposable 1-factorizat

Constructing indecomposable 1-factorizations of the complete multigraph

✍ Dan Archdeacon; Jeffrey H. Dinitz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 762 KB

Archdeacon, D. and J.H. Dinitz. Constructing indecomposable I-factorizations of the complete multigraph, Discrete Mathematics 92 (1991) 9-19.

P4k−1-factorization of bipartite multigr

P4k−1-factorization of bipartite multigraphs

✍ Jian Wang; Beiliang Du 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 206 KB

Some upper bounds on the total and list

Some upper bounds on the total and list chromatic numbers of multigraphs

✍ Roland Häggkvist; Amanda Chetwynd 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

## Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an __n__‐order multigraph exceeds the chromatic index by the smallest __t__ such that __t__! > __n__.