✦ LIBER ✦

The binding number of Halin graphs

✍ Scribed by Mirosława Skowrońska

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 304 KB
Volume: 22
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90126-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complete chromatic number of Hali

On the complete chromatic number of Halin graphs

✍ Zhongfu Zhang; Linzhong Liu 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 300 KB

Edge-face chromatic number of Halin-grap

Edge-face chromatic number of Halin-graphs

✍ Zhongfu Zhang; Xinzhong Lu; Linzhong Liu; Jianfang Wang; Tongxin Gu 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 50 KB

The vertex-face total chromatic number o

The vertex-face total chromatic number of Halin graphs

✍ Lam, Peter C. B.; Zhang, Zhongfu 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB 👁 2 views

In this paper, we shall first prove that for a Halin graph G, 4 °xT (G) °6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and suff

Minimum cycle bases of Halin graphs

✍ Peter F. Stadler 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003

Lengths of cycles in halin graphs

✍ J. A. Bondy; L. Lovász 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB 👁 1 views

A Halin graph is a plane graph H = T U C, where T is a plane tree with no vertex of degree t w o and at least one vertex of degree three or more, and C is a cycle connecting the endvertices of T in the cyclic order determined by the embedding of T We prove that such a graph on n vertices contains cy

A note on the total chromatic number of

A note on the total chromatic number of Halin graphs with maximum degree 4

✍ Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

In this paper, we prove that XT(G) = 5 for any Halin graph G with A(G) = 4, where A(G) and XT(G) denote the maximal degree and the total chromatic number of G, respectively.