𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on locating a central vertex of a 3-cactus graph

✍ Scribed by Rex K. Kincaid; Oded Z. Maimon

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
531 KB
Volume
17
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on vertex pancyclic oriented grap
A note on vertex pancyclic oriented graphs
✍ Bang-Jensen, JοΏ½rgen; Guo, Yubao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 185 KB πŸ‘ 2 views

Let D be an oriented graph of order n β‰₯ 9, minimum degree at least n -2, such that, for the choice of distinct vertices x and y, . Graph Theory 18 (1994), 461-468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also

On packing 3-vertex paths in a graph
On packing 3-vertex paths in a graph
✍ Atsushi Kaneko; Alexander Kelmans; Tsuyoshi Nishimura πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 276 KB πŸ‘ 2 views
On vertex ranking of a starlike graph
On vertex ranking of a starlike graph
✍ Sun-yuan Hsieh πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 76 KB

A vertex coloring c : V β†’ {1, 2, . . . , t} of a graph G = (V , E) is a vertex t-ranking if for any two vertices of the same color every path between them contains a vertex of larger color. The vertex ranking number Ο‡ r (G) is the smallest value of t such that G has a vertex t-ranking. A Ο‡ r (G)-ran