✦ LIBER ✦

Enumeration of cyclic graphs and cyclic designs

✍ Scribed by H.A David

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 316 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90067-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of cyclically 4-connected cu

Enumeration of cyclically 4-connected cubic graphs

✍ Nicholas C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 550 KB

Cyclic resolvability of cyclic Steiner 2

Cyclic resolvability of cyclic Steiner 2-designs

✍ Masaki Genma; Miwako Mishima; Masakazu Jimbo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

In this article, direct and recursive constructions for a cyclically resolvable cyclic Steiner 2-design are given.

Cyclicity of graphs

✍ Hammack, Richard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB 👁 2 views

The cyclicity of a graph is the largest integer n for which the graph is contractible to the cycle on n vertices. By analyzing the cycle space of a graph, we establish upper and lower bounds on cyclicity. These bounds facilitate the computation of cyclicity for several classes of graphs, including c

Cyclic designs and uniformly deep famili

Cyclic designs and uniformly deep families

✍ Wayne M Dymacek; D.P Roselle 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Loop and cyclic niche graphs

✍ Charles A. Anderson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Cyclic coloring of plane graphs

✍ Oleg V. Borodin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 637 KB

Borodin, O.V., Cyclic coloring of plane graphs, Discrete Mathematics 100 (1992) 281-289. Let G be a plane graph, and let x,(G) be the minimum number of colors to color the vertices of G so that every two of them which lie in the boundary of the same face of the size at most k, receive different colo