✦ LIBER ✦

On 3-Transitive Graphs of Girth 6

✍ Scribed by K. Ching

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 313 KB
Volume: 62
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructions of small regular bipartite

Constructions of small regular bipartite graphs of girth 6

✍ G. Araujo-Pardo; Camino Balbuena 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

3-List-Coloring Planar Graphs of Girth 5

✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch's theorem that every planar graph of girth at least 4 is 3-colorable. If 1995 Academic Press, Inc.

On the girth of hamiltonian weakly pancy

On the girth of hamiltonian weakly pancyclic graphs

✍ Bollob�s, B�la; Thomason, Andrew 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. In answer to a question of Erdős, we show that a Hamiltonian weakly-pancyclic graph of order n can have girth as large as about 2 n/ log n. In contrast to this, we show that the existence of

The smallest graph of girth 6 and valenc

The smallest graph of girth 6 and valency 7

✍ M. O'Keefe; P. K. Wong 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

## Abstract With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.

Small vertex-transitive and Cayley graph

Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach

✍ Eyal Loz; Martin Mačaj; Mirka Miller; Jana Šiagiová; Jozef Širáň; Jana Tomanová 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

We examine the existing constructions of the smallest known vertex-transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of

On the uniqueness of the smallest graph

On the uniqueness of the smallest graph of girth 5 and valency 6

✍ Pak-Ken Wong 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

Let G be a regular graph of girth n( 2 5 ) and valency k ( r 3 ) , that has the least possible number f(k, n ) of vertices. Although the existence of such a graph was proved by Erdos and Sachs (see Ref. 6, p. 82), only a few cases have been solved (see Refs. 2-7). Recently, O'Keefe and Wong have sho