𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some theorems of uniquely pancyclic graphs

✍ Scribed by Yongbing Shi

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
773 KB
Volume
59
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On some factor theorems of graphs
On some factor theorems of graphs
✍ Mao-cheng Cai πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 362 KB

The aim of this note is to show that some recently published results on graph factors derive fairly easily from Lovrisz' (g,f)-factor theorems.

Pancyclic subgraphs of random graphs
Pancyclic subgraphs of random graphs
✍ Choongbum Lee; Wojciech Samotij πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 249 KB

## Abstract An __n__‐vertex graph is called pancyclic if it contains a cycle of length __t__ for all 3≀__t__≀__n__. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if __p__>__n__^βˆ’1/2^, then the random graph __G__(__n, p__) a.a.s. satisfies the f

Pancyclicity of connected circulant grap
Pancyclicity of connected circulant graphs
✍ Bogdanowicz, Z. R. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 299 KB πŸ‘ 1 views

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi

Some theorems on graphs and posets
Some theorems on graphs and posets
✍ William T. Trotter Jr.; John I. Moore Jr. πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 800 KB

In this journal, Lcclerc proved that the dimension of the partiailly ordered slet consisting of all subf~ce'~ of a tree T, m&red by inclusion, is the number of end yuints of 'I'. Leclerc posed the probkrn of determitAng the dimension the partially ed set P consisting of all inducxxI connected subgra