✦ LIBER ✦

Two conjectures on edge-colouring

✍ Scribed by A.J.W. Hilton

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 311 KB
Volume: 74
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90198-2

No coin nor oath required. For personal study only.

✦ Synopsis

Chetwynd and Hilton have elsewhere posed two conjectures, one a general statement on edge-colouring simple graphs G with A(G) > i lV(G)I, and a second to the effect that a regular simple graph G with d(G) 3 -1 IV(G)

1 is l-factorizable. We set out the evidence for both these conjectures and show that the first implies the second.

📜 SIMILAR VOLUMES

Tutte's Edge-Colouring Conjecture

✍ Neil Robertson; Paul Seymour; Robin Thomas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 340 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birthday Tutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. The conjecture is still open, but we show that it is true, in general, provided it

Recent progress on edge-colouring graphs

✍ A.J.W Hilton 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 315 KB

In this note we summarize some of the progress made recently by the author, A.G. Chetwynd and P.D. Johnson about edge-eolourings of graphs with relatively large maximum degree. In this note, multigraphs will have no loops. For a multigraph G, the least number of colours needed to colour the edges o

On characterizing Vizing's edge colourin

On characterizing Vizing's edge colouring bound

✍ Penny Haxell; Jessica McDonald 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

**Features recent advances and new applications in graph edge coloring**Reviewing recent advances in the Edge Coloring Problem, __Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture__ provides an overview of the current state of the science, explaining the interconnections among the resu

Edge-colouring random graphs

✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Path and cycle sub-ramsey numbers and an

Path and cycle sub-ramsey numbers and an edge-colouring conjecture

✍ Geňa Hahn; Carsten Thomassen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We show the existence of a constant c such that if n >I ck 3 and the edges of K,, are coloured using no colour more than k times then there is a Hamilton path with all edges of distinct colours. From this we infer that sr(Pn, k) = sr(Cn, k) = n, whenever n >t ck 3. We follow for notation and termi

On Two Conjectures about Practical Numbe

On Two Conjectures about Practical Numbers

✍ Giuseppe Melfi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB

A positive integer m is said to be a practical number if every integer n, with 1 n \_(m), is a sum of distinct positive divisors of m. In this note we prove two conjectures of Margenstern: (i) every even positive integer is a sum of two practical numbers; (ii) there exist infinitely many practical