✦ LIBER ✦

-Optimally half vertex transitive graphs with regularity k

✍ Scribed by Yingzhi Tian; Jixiang Meng

Book ID: 108154627
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 158 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.03.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quartic half-arc-transitive graphs with

Quartic half-arc-transitive graphs with large vertex stabilizers

✍ Dragan Marušič 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 269 KB

On Super Restricted Edge Connectivity of

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs

✍ Yingzhi Tian; Jixiang Meng; Xiaodong Liang 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 188 KB

Vertex-Transitive Non-Cayley Graphs with

Vertex-Transitive Non-Cayley Graphs with Arbitrarily Large Vertex-Stabilizer

✍ Marston D.E. Conder; Cameron G. Walker 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 143 KB

On edge but not vertex transitive regula

On edge but not vertex transitive regular graphs

✍ I.Z Bouwer 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Vertex Partitions by Connected Monochrom

Vertex Partitions by Connected Monochromatic k-Regular Graphs

✍ Gábor N. Sárközy; Stanley M. Selkow 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Plane four-regular graphs with vertex-to

Plane four-regular graphs with vertex-to-vertex unit triangles

✍ Heiko Harborth 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Harborth, H., Plane four-regular graphs with vertex-to-vertex unit triangles, Discrete Mathematics 97 (1991) 219-222. For the smallest number of non-overlapping vertex-to-vertex unit triangles in the plane it is proved ~42 in general, and <3800 if additional triangles are not allowed.