𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On total chromatic number of planar graphs without 4-cycles

✍ Scribed by Ying-qian Wang; Min-le Shangguan; Qiao Li

Book ID
107368302
Publisher
SP Science China Press
Year
2007
Tongue
English
Weight
166 KB
Volume
50
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

πŸ“œ 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

On the number of graphs without 4-cycles
On the number of graphs without 4-cycles
✍ Daniel J. Kleitman; Kenneth J. Winston πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 534 KB
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

## Abstract In this article we prove that the total chromatic number of a planar graph with maximum degree 10 is 11. Β© 2006 Wiley Periodicals, Inc. J Graph Theory 54: 91–102, 2007