✦ LIBER ✦

Transformations of edge-coloured cubic graphs

✍ Scribed by Yasuyuki Tsukui

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 491 KB
Volume: 184
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00088-5

No coin nor oath required. For personal study only.

✦ Synopsis

For a simple 3-edge-coloured cubic graph, an edge-c-reduction and three transformations (S-, X-, and H-transformation) are defined. Each transformation preserves order and regularity of graphs. They also define metrics on the set of all (connected) 3-edge-coloured cubic graphs with the same order. All connected irreducible 3-edge-coloured cubic graphs are determined.

📜 SIMILAR VOLUMES

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

Properly coloured Hamiltonian paths in e

Properly coloured Hamiltonian paths in edge-coloured complete graphs

✍ J. Bang-Jensen; G. Gutin; A. Yeo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 251 KB

We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the follou~ng conjecture by B. Bollobis and P. Erdijs (1976): if G is an edge-coloured complete graph on )I vertices in which the max

Edge-colouring random graphs

✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Edge colouring line graphs of unicyclic

Edge colouring line graphs of unicyclic graphs

✍ Leizhen Cai; John A. Ellis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Representing branched coverings by Edge-

Representing branched coverings by Edge-Coloured Graphs

✍ Maria Rita Casali; Luigi Grasselli 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Given a link L ~ S 3, we describe a standard method for constructing a class l~, d of 4-coloured graphs representing all closed orientable 3-manifolds which are d-fold coverings of S 3 branched over the link L.

Edge-coloured complete graphs: Connected

Edge-coloured complete graphs: Connectedness of some subgraphs

✍ Adam Idzik; Jan Komar; Marcin Malawski 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 435 KB

If the edges of a complete graph K,., m/> 4, are painted two colours so that monochromatic K " graphs are connected, then there exists an increasing sequence ( n)n~4 of complete subgraphs whose monochromatic subgraphs are also connected. For more than two colours this is not true, but an analogous f