✦ LIBER ✦

Total chromatic number of regular graphs of odd order and high degree

✍ Scribed by K.H. Chew

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 695 KB
Volume: 154
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00034-t

No coin nor oath required. For personal study only.

✦ Synopsis

The total chromatic number XT(G) of a graph G is the least number of colours needed to colour the edges and vertices of G so that no incident or adjacent elements receive the same colour. This paper shows that if G is odd order and regular of degree d > [(&? -1)/6]1 V(G)/, then a necessary and sufficient condition for XT(G) = d + 1 is given. This improves a recent result of .

📜 SIMILAR VOLUMES

Total chromatic number of planar graphs

Total chromatic number of planar graphs with maximum degree ten

✍ Weifan Wang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

The total chromatic number of graphs hav

The total chromatic number of graphs having large maximum degree

✍ A.J.W. Hilton; H.R. Hind 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 935 KB

Hilton, A.J.W. and H.R. Hind, The total chromatic number ofgraphs having large maximum degree, Discrete Mathematics 117 (1993) 127-140. The total colouring conjecture is shown to be correct for those graphs G having d(G)>21 V(G)I.

The total chromatic number of regular gr

The total chromatic number of regular graphs whose complement is bipartite

✍ J.K. Dugdale; A.J.W. Hilton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 705 KB

We show that a regular graph G of order at least 6 whose complement c is bipartite has total chromatic number d(G) + 1 if and only if (i) G is not a complete graph, and (ii) G#K when n is even. As an aid in"';he proof of this, we also show that , for n>4, if the edges of a Hamiltonian path of Kzn a

Balloons, cut-edges, matchings, and tota

Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree

✍ Suil O; Douglas B. West 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB 👁 1 views

## Abstract A __balloon__ in a graph __G__ is a maximal 2‐edge‐connected subgraph incident to exactly one cut‐edge of __G__. Let __b__(__G__) be the number of balloons, let __c__(__G__) be the number of cut‐edges, and let α′(__G__) be the maximum size of a matching. Let \documentclass{article}\usep

Factorizations of regular graphs of high

Factorizations of regular graphs of high degree

✍ A. J. W. Hilton 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,

Total chromatic number of complete r-par

Total chromatic number of complete r-partite graphs

✍ K. H. Chew; H. P. Yap 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB 👁 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par