𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tight upper bound on the ()-total labeling number of outerplanar graphs

✍ Scribed by Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono; Yushi Uno

Book ID
113699089
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
512 KB
Volume
14
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the total chromatic n
An upper bound for the total chromatic number of dense graphs
✍ H. R. Hind πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 1 views

## Abstract In this paper we consider those graphs that have maximum degree at least 1/__k__ times their order, where __k__ is a (small) positive integer. A result of Hajnal and SzemerΓ©di concerning equitable vertex‐colorings and an adaptation of the standard proof of Vizing's Theorem are used to s