✦ LIBER ✦

Semisymmetric cubic graphs as regular covers ofK3,3

✍ Scribed by Chang Qun Wang; Tie Sheng Chen

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2008
Tongue: English
Weight: 230 KB
Volume: 24
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-007-0998-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

s-Regular cubic graphs as coverings of t

s-Regular cubic graphs as coverings of the complete bipartite graph K3,3

✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts freely and transitively on the set of __s__‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the __s__‐regular cyclic cov

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

The number of edge 3-colorings of a plan

The number of edge 3-colorings of a planar cubic graph as a permanent

✍ David E. Scheim 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 370 KB

In this paper, we establish that the number of edge 3-colorings of a finite planar cubic graph G, i.e., 3-colorings of its interchange graph H, is equal to 2\*lPermanent(A)l, where N is the number of edges of G, and A is the 2N X 2iV square matrix formed by repeating each row of the N X 2N vertexdir