𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ON UNIQUELY -G k-COLOURABLE GRAPHS

✍ Scribed by Brown, J. I.; Corneil, D. G.

Book ID
118165341
Publisher
Taylor and Francis Group
Year
1992
Tongue
English
Weight
445 KB
Volume
15
Category
Article
ISSN
1607-3606

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Uniquely (m, k)Ο„-colourable graphs and k
Uniquely (m, k)Ο„-colourable graphs and k βˆ’ Ο„-saturated graphs
✍ Gerhard BenadΓ©; Izak Broere; Betsie Jonck; Marietjie Frick πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 518 KB

For a graph G, the path number r(G) is defined as the order of a longest path in G. An (m, k)~-colouring of a graph H is a partition of the vertex set of H into m subsets such that each subset induces a subgraph of H for which r is at most k. The k -z-chromatic number z~(H) is the least m for which