𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalization of two results of Hilton on total-colourings of a graph

✍ Scribed by H.P. Yap

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
331 KB
Volume
140
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new upper bound for total colourings o
A new upper bound for total colourings of graphs
✍ AbdΓ³n SΓ‘nchez-Arroyo πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 118 KB

We give a new upper bound on the total chromatic number of a graph. This bound improves the results known for some classes of graphs. The bound is stated as follows: ZT ~< Z~ + L l3 ~ J + 2, where Z is the chromatic number, Z~ is the edge chromatic number (chromatic index) and ZT is the total chroma

A result on decompositions of regular gr
A result on decompositions of regular graphs
✍ Xiang-Ying Su πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 224 KB

A result on decompositions of regular graphs, Discrete Mathematics 105 (1992) 323-326. We prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that x(H) = x(G) and o

Survey of results on the maximum genus o
Survey of results on the maximum genus of a graph
✍ Richard D. Ringeisen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

## Abstract Some of the early questions concerning the maximum genus of a graph have now been answered. In this paper we survey the progress made on such problems and present some recent results, outlining proofs for some of the major theorems.

On Colouring Partial Joins of a Complete
On Colouring Partial Joins of a Complete Graph and a Cycle
✍ M. Stiebitz; W. Wessel πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

## Abstract Define the partial join of two graphs to be some graph arising from their disjoint union by adding a set of new edges each joining a vertex of the first graph and a vertex of the second one. We characterize all colour‐critical graphs being partial joins of a complete graph and an odd cy