✦ LIBER ✦

On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs

✍ Scribed by Tiziana Calamoneri; Saverio Caminiti; Rossella Petreschi; Stephan Olariu

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 124 KB
Volume: 53
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20257

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the construction of optimally reliabl

On the construction of optimally reliable graphs

✍ Derek H. Smith; Lynne L. Doty 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB

Sharp bounds for the number of 3-indepen

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

✍ F. M. Dong; K. M. Koh; K. L. Teo; C. H. C. Little; M. D. Hendy 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract Given a graph __G__ and an integer __k__ ≥ 1, let α(__G, k__) denote the number of __k__‐independent partitions of __G__. Let 𝒦^−s^(__p,q__) (resp., 𝒦~2~^−s^(__p,q__)) denote the family of connected (resp., 2‐connected) graphs which are obtained from the complete bipartite graph __K~p,q