๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of uniquely vertexk-colorable graphs with minimum possible size

โœ Scribed by Min Zhao; Li-ying Kang

Book ID
107482526
Publisher
Chinese Electronic Periodical Services
Year
2007
Tongue
English
Weight
159 KB
Volume
11
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Kr-Free Uniquely Vertex Colorable Graphs
Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges
โœ S. Akbari; V.S. Mirrokni; B.S. Sadjad ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 112 KB

We construct counterexamples to the conjecture of Xu (1990, J. Combin. Theory Ser. B 50, 319 320) that every uniquely r-colorable graph of order n with exactly (r&1) n&( r2 ) edges must contain a K r . ## 2001 Academic Press Harary et al. [4] constructed uniquely r-colorable graphs containing no