𝔖 Bobbio Scriptorium
✦   LIBER   ✦

OnL(2,1)-labeling of generalized Petersen graphs

✍ Scribed by Yuan-Zhen Huang, Chun-Ying Chiang, Liang-Hao Huang, Hong-Gwa Yeh

Book ID
118801973
Publisher
Springer US
Year
2011
Tongue
English
Weight
639 KB
Volume
24
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Classifying 2-extendable generalized Pet
Classifying 2-extendable generalized Petersen graphs
✍ Qinglin Yu πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 559 KB

A graph is said to be 2-extendable if any two edges which do not have a common vertex are contained in a l-factor of the graph. In this paper, we show that the generalized Petersen graph GP(n, k) is 2-extandable for all n # 2k or 3k whenever k 2 3, as conjectured by Cammack and Schrag.

On the 2-extendability of the generalize
On the 2-extendability of the generalized Petersen graphs
✍ Gerald Schrag; Larry Cammack πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 731 KB

A graph G is n-extendable if it is connected, contains a set of rr independent edges and every set of n-independent edges extends to (i.e. is a subset of) a perfect matching. Combining the results of this and previous papers we answer the question of 2-extendability for all the generalized Petersen

Exact Algorithms forL(2,1)-Labeling of G
Exact Algorithms forL(2,1)-Labeling of Graphs
✍ FrΓ©dΓ©ric Havet; Martin Klazar; Jan KratochvΓ­l; Dieter Kratsch; Mathieu Liedloff πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 850 KB