✦ LIBER ✦

Fractional total colouring

✍ Scribed by Jennifer Ryan

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 281 KB
Volume: 27
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90073-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fractionally colouring total graphs

✍ K. Kilakos; B. Reed 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 312 KB

Fractional Colouring and Hadwiger's Conj

Fractional Colouring and Hadwiger's Conjecture

✍ Bruce Reed; Paul Seymour 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Recent developments in total colouring

✍ H.R. Hind 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 457 KB

This paper gives a number of recent results concerning total colourings and suggests that recolouring schemes which are somewhat more complex than those currently being considered, need to be developed. Some examples of graphs and colourings which support this assertion are presented. The aim of th

Determining the total colouring number i

Determining the total colouring number is np-hard

✍ Abdón Sánchez-Arroyo 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 279 KB

In this paper it is proved that the problem of deteruzining the totai chromatic number of an arbitrary'graph is NP-hard. The problem remains NP-hard even for cubic bipartite graphs.

Total colouring regular bipartite graphs

Total colouring regular bipartite graphs is NP-hard

✍ Colin J.H. McDiarmid; Abdón Sánchez-Arroyo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The total chromatic number of an arbitrary graph is the smallest number of colours needed to colour the edges and vertices of the graph so that no two adjacent or incident elements of the graph receive the same colour. In this paper we prove that the problem of determining the total chromatic number

An upper bound for total colouring of gr

An upper bound for total colouring of graphs

✍ Colin J.H. McDiarmid; Abdón Sánchez-Arroyo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 235 KB

An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 co