𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 4-ordered 3-regular graphs

✍ Scribed by Ming Tsai; Tsung-Han Tsai; Jimmy J.M. Tan; Lih-Hsing Hsu

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
295 KB
Volume
54
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

3-colorability of 4-regular hamiltonian
3-colorability of 4-regular hamiltonian graphs
✍ Herbert Fleischner; Gert Sabidussi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB 👁 1 views

## Abstract On the model of the cycle‐plus‐triangles theorem, we consider the problem of 3‐colorability of those 4‐regular hamiltonian graphs for which the components of the edge‐complement of a given hamiltonian cycle are non‐selfcrossing cycles of constant length ≥ 4. We show that this problem is

Distance regular graphs of diameter 3 an
Distance regular graphs of diameter 3 and strongly regular graphs
✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

Alternating diagrams of 4-regular graphs
Alternating diagrams of 4-regular graphs in 3-space
✍ Jörg Sawollek 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Embeddings of 4-regular graphs into 3-space are examined by studying graph diagrams, i.e., projections of embedded graphs to an appropriate plane. An invariant of graph diagrams, first introduced by Yokota, is re-formulated and used to show that reduced alternating diagrams have minimal crossing num

Cubic s-regular graphs of order 2p3
Cubic s-regular graphs of order 2p3
✍ Yan-Quan Feng; Jin Ho Kwak; Ming-Yao Xu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts regularly on the set of its __s__‐arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge‐transitive, but not vertex‐transitive graphs of order 2__p__^3^ for each prime __p__. In this article, we

Uniqueness of maximal dominating cycles
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
✍ Herbert Fleischner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 2 views

## Abstract We construct 3‐regular (cubic) graphs __G__ that have a dominating cycle __C__ such that no other cycle __C__~1~ of __G__ satisfies __V(C)__ ⊆ __V__(__C__~1~). By a similar construction we obtain loopless 4‐regular graphs having precisely one hamiltonian cycle. The basis for these const