✦ LIBER ✦

ABOUT A POLYHEDRON OF CUBIC GRAPHS

✍ Scribed by Bondarenko, V.A. ;Yurov, S.V.

Book ID: 121700674
Publisher: IOS Press
Year: 1996
Tongue: English
Weight: 51 KB
Volume: 25
Category: Article
ISSN: 0169-2968
DOI: 10.3233/fi-1996-25103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Incidence graphs of polyhedrons

✍ V. I. Sokolov 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 138 KB

Bifurcation Analysis of Cubic Autocataly

Bifurcation Analysis of Cubic Autocatalytic Reactions: Newton Polyhedron Approach

✍ Adesina, A. A. 📂 Article 📅 2008 🏛 Curtin University of Technology 🌐 English ⚖ 495 KB

Counterexamples to a conjecture about bo

Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs

✍ Eckhard Steffen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 47 KB

We follow the terminology and notion of . By a well known theorem of Vizing it follows that the chromatic index z'(G) of a cubic graph G is 3 or 4. If z'(G) = 4 we say that G is non-Tait-colourable. Holroyd and Loupekine [1] defined a bottleneck in a non-Tait-colourable cubic graph G =

A characterization of planar cubic graph

A characterization of planar cubic graphs

✍ Charles H.C Little 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 676 KB

Diameters of cubic graphs

✍ Leif K. Jørgensen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Transformations of cubic graphs

✍ Yasuyuki Tsukui 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 401 KB

For simple r-regular graph, an edge-reduction and three transformations (S-, X-, and ~-transformations) are defined which preserve the regularity. In the case r = 3, relations between them are discussed and it is proved that for any two connected cubic graphs with the same order one is obtained from