𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On non-Hamiltonian circulant digraphs of outdegree three

✍ Scribed by Locke, Stephen C.; Witte, Dave

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
136 KB
Volume
30
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We construct infinitely many connected, circulant digraphs of outdegree three that have no Hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vertex is adjacent to the vertex diametrically opposite to itself.

πŸ“œ SIMILAR VOLUMES

A note on complete subdivisions in digra
A note on complete subdivisions in digraphs of large outdegree
✍ Daniela KΓΌhn; Deryk Osthus; Andrew Young πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 1 views

## Abstract Mader conjectured that for all $\ell$ there is an integer $\delta^+(\ell)$ such that every digraph of minimum outdegree at least $\delta^+(\ell)$ contains a subdivision of a transitive tournament of order $\ell$. In this note, we observe that if the minimum outdegree of a digraph is suf

On Vertices of outdegree n in minimally
On Vertices of outdegree n in minimally n-connected digraphs
✍ W. Mader πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 1 views

## Abstract Let |__D__| and |D|^+^~__n__~ denote the number of vertices of __D__ and the number of vertices of outdegree __n__ in the digraph __D__, respectively. It is proved that every minimally __n__‐connected, finite digraph __D__ has |D|^+^~__n__~ β‰₯ __n__ + 1 and that for __n__ β‰₯ 2, there is a

On topological tournaments of order 4 in
On topological tournaments of order 4 in digraphs of outdegree 3
✍ Mader, W. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 371 KB πŸ‘ 1 views

It is proved that every finite digraph of minimum outdegree 3 contains a subdivision of the transitive tournament on 4 vertices.

On Non-Cayley Vertex-Transitive Graphs o
On Non-Cayley Vertex-Transitive Graphs of Order a Product of Three Primes
✍ Mohammad A. Iranmanesh; Cheryl E. Praeger πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 192 KB

This paper completes the determination of all integers of the form pqr (where p, q, and r are distinct primes) for which there exists a vertex-transitive graph on pqr vertices which is not a Cayley graph.