𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Uniquely colourable m-dichromatic oriented graphs

✍ Scribed by V Neumann-Lara; N Santoro; J Urrutia

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
362 KB
Volume
62
Category
Article
ISSN
0012-365X

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

Elementary Bipartite Graphs and Unique C
Elementary Bipartite Graphs and Unique Colourability
✍ GΓ‘bor BacsΓ³ πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 44 KB

The Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different from a clique, contains two maximum size cliques having a two element symmetric difference. One can make an auxiliary graph B from a minimal counterexample for the CPC (if any exists), this B is bipartite. We

Circular Colouring and Orientation of Gr
Circular Colouring and Orientation of Graphs
✍ Xuding Zhu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 88 KB

This paper proves that if a graph G has an orientation D such that for each cycle C with djCj Γ°mod kÞ 2 f1; 2; . . . ; 2d Γ€ 1g we have jCj=jC ΓΎ j4k=d and jCj=jC Γ€ j4k=d; then G has a Γ°k; dÞ-colouring and hence w c Γ°GÞ4k=d: This is a generalization of a result of Tuza (J. Combin. Theory Ser. B 55 (19