𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The vertex-face total chromatic number of Halin graphs

✍ Scribed by Lam, Peter C. B.; Zhang, Zhongfu

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
69 KB
Volume
30
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we shall first prove that for a Halin graph G, 4 Β°xT (G) Β°6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and sufficient condition for a Halin graph to have a vertex-face total chromatic number of 4 and describe a way of assigning the four colors to such graphs.

πŸ“œ SIMILAR VOLUMES

On the vertex face total chromatic numbe
On the vertex face total chromatic number of planar graphs
✍ Weifan, Wang; Jiazhuang, Liu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 471 KB πŸ‘ 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 198 KB πŸ‘ 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

On the chromatic number of disk graphs
On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; WeiοΏ½enfels, Gerhard πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

The star-chromatic number of planar grap
The star-chromatic number of planar graphs
✍ Moser, David πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

The star-chromatic number of a graph, a parameter introduced by Vince, is a natural generalization of the chromatic number of a graph. Here we construct planar graphs with star-chromatic number r, where r is any rational number between 2 and 3, partially answering a question of Vince.

The circular chromatic number of series-
The circular chromatic number of series-parallel graphs
✍ Hell, Pavol; Zhu, Xuding πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 238 KB πŸ‘ 1 views

In this article, we consider the circular chromatic number Ο‡ c (G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a seriesparallel graph G contains a triangle, then both the chromati