𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fractionally colouring total graphs

✍ Scribed by K. Kilakos; B. Reed

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
312 KB
Volume
13
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fractional total colouring
Fractional total colouring
✍ Jennifer Ryan πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 281 KB
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

Edge-colouring random graphs
Edge-colouring random graphs
✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 653 KB
Colouring series-parallel graphs
Colouring series-parallel graphs
✍ P. D. Seymour πŸ“‚ Article πŸ“… 1990 πŸ› Springer-Verlag 🌐 English βš– 634 KB