𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Onk-th Power of Upper Bound Graphs

✍ Scribed by Morimasa Tsuchiya

Book ID
105764644
Publisher
Springer
Year
2003
Tongue
English
Weight
157 KB
Volume
7
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On distance two graphs of upper bound gr
On distance two graphs of upper bound graphs
✍ Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 190 KB
A note on construction of upper bound gr
A note on construction of upper bound graphs
✍ Hiroshi Era; Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiyao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 293 KB
An upper bound for total colouring of gr
An upper bound for total colouring of graphs
✍ Colin J.H. McDiarmid; AbdΓ³n SΓ‘nchez-Arroyo πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 235 KB

An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 co