𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pancyclic out-arcs of a vertex in oriented graphs

✍ Scribed by Qiaoping Guo; Shengjia Li; Ruijuan Li; Gaokui Xu

Book ID
116577143
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
136 KB
Volume
112
Category
Article
ISSN
0020-0190

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

A local tournament contains a vertex who
A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
✍ Wei Meng; Shengjia Li; Yubao Guo; Gaokui Xu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 170 KB

## Abstract An arc leaving a vertex x in a digraph is called an out‐arc of x. Thomassen (J Combin Theory Ser B 28 (1980), 142–163) proved that every strong tournament contains a vertex whose every out‐arc is contained in a Hamiltonian cycle. In 2000, Yao et al. (Discrete Appl Math 99 (2000), 245–24

Some remarks on Arc-connectivity, vertex
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs
✍ Bill Jackson πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio