✦ LIBER ✦

Vertex pancyclicity and new sufficient conditions

✍ Scribed by ZHAO, KEWEN; LIN, YUE

Book ID: 120250654
Publisher: Indian Academy of Sciences
Year: 2012
Tongue: English
Weight: 160 KB
Volume: 122
Category: Article
ISSN: 0253-4142
DOI: 10.1007/s12044-012-0083-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new sufficient condition for pancyclab

A new sufficient condition for pancyclability of graphs

✍ Cai, Junqing; Li, Hao 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 403 KB

A sufficient condition for pancyclic gra

A sufficient condition for pancyclic graphs

✍ Kewen Zhao; Yue Lin; Ping Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Dirac’s Type Sufficient Conditions for H

Dirac’s Type Sufficient Conditions for Hamiltonicity and Pancyclicity

✍ Ahmed Ainouche 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 153 KB

A sufficient condition for pancyclabilit

A sufficient condition for pancyclability of graphs

✍ E. Flandrin; H. Li; B. Wei 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Vertex-pancyclicity of hypertournaments

✍ Jed Yang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract A hypertournament or a __k__‐tournament, on __n__ vertices, 2≤__k__≤__n__, is a pair __T__=(__V, E__), where the vertex set __V__ is a set of size __n__ and the edge set __E__ is the collection of all possible subsets of size __k__ of __V__, called the edges, each taken in one of its __

Characterizations of vertex pancyclic an

Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs

✍ G. Gutin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 527 KB

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite graph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with both end vert