Labelings of plane graphs containing Hamilton path
✍ Scribed by Martin Bača; Ljiljana Brankovic; Andrea Semaničová-Feňovčíková
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2011
- Tongue
- English
- Weight
- 353 KB
- Volume
- 27
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is __weakly n__‐__HP‐
This paper concerns a labeling problem of the plane graphs P,,. The present paper describes a nqic vertex labeling and a consecutive labeling ef type (0, I, I). These labelings combine to a consecutice labeling qf type (I, I, I).
The paper describes special ma~qic labelings gf' vertices, edges and ,faces qf' a special class of plane graphs ltlith 3-sided internal f&es, in which the labels of vertices and e&es incident with a,fkce sum to a value prescribedfor that face.