𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On point-sets that support planar graphs

✍ Scribed by V. Dujmović; W. Evans; S. Lazard; W. Lenhart; G. Liotta; D. Rappaport; S. Wismath

Book ID
119220212
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
612 KB
Volume
46
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On point-linear arboricity of planar gra
On point-linear arboricity of planar graphs
✍ Jianfang Wang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The point-linear arboricity of a graph G = (V, E), written as p,(G), is defined as p,(G) =min{k / there exists a partition of V into k subsets, V =LJt, V,, such that (V,) is a linear forest for 1 <i <k}. In this paper, we will discuss the point-linear arboricity of planar graphs and obtained follow

On point-set domination in graphs IV: Se
On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets
✍ B.D. Acharya; Purnima Gupta 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 675 KB

A set D of vertices in a graph G =-(V,E) is called a point-set dominating (or, psd-) set of G if for every nonempty subset S of V -D there exists v E D such that the induced subgraph (S U {v}) is connected (cf. Sampthkumar and Pushpa Latha (1993) [6]). Here, we report results of our investigation in