✦ LIBER ✦

Note on the colouring of graphs

✍ Scribed by G. A. Dirac

Publisher: Springer-Verlag
Year: 1951
Tongue: French
Weight: 400 KB
Volume: 54
Category: Article
ISSN: 0025-5874
DOI: 10.1007/bf01238034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On edge-colouring indifference graphs

✍ Celina M.H. de Figueiredo; João Meidanis; Célia Picinin de Mello 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

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

Edge colouring line graphs of unicyclic

Edge colouring line graphs of unicyclic graphs

✍ Leizhen Cai; John A. Ellis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 691 KB

A Note on Alternating Cycles in Edge-Col

A Note on Alternating Cycles in Edge-Coloured Graphs

✍ Anders Yeo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is

A note on the colouring matter of lac la

A note on the colouring matter of lac larvae

✍ Harbhajan Singh; T.R. Seshadri; G.B.V. Subramanian 📂 Article 📅 1966 🏛 Elsevier Science 🌐 French ⚖ 340 KB

Circular Colouring and Orientation of Gr

Circular Colouring and Orientation of Graphs

✍ Xuding Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

This paper proves that if a graph G has an orientation D such that for each cycle C with djCj ðmod kÞ 2 f1; 2; . . . ; 2d À 1g we have jCj=jC þ j4k=d and jCj=jC À j4k=d; then G has a ðk; dÞ-colouring and hence w c ðGÞ4k=d: This is a generalization of a result of Tuza (J. Combin. Theory Ser. B 55 (19