✦ LIBER ✦

Representing branched coverings by Edge-Coloured Graphs

✍ Scribed by Maria Rita Casali; Luigi Grasselli

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 539 KB
Volume: 33
Category: Article
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(89)80008-2

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Coloured knots and coloured graphs repre

Coloured knots and coloured graphs representing 3-fold simple coverings of %plane1D;54A;3

✍ Mari Rita Casali 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 525 KB

It is well-known that every closed orientable 3-manifold M 3 is the 3-fold simple covering M3(K,o)) of S 3 branched over a knot K: hence, M 3 may be visualized by the associated coloured knot (K, co). On the other hand, PL-manifolds of arbitrary dimension may be represented by coloured graphs, via p

Vertex Coverings by Coloured Induced Gra

Vertex Coverings by Coloured Induced Graphs—Frames and Umbrellas

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Representing Groups by Colourings of Gra

Representing Groups by Colourings of Graphs

✍ Ulrike Baumann 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

Covering the Edges of a Connected Graph

Covering the Edges of a Connected Graph by Paths

✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

Covering the edges of a graph by three o

Covering the edges of a graph by three odd subgraphs

✍ Tamás Mátrai 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

On the number of irreducible coverings b

On the number of irreducible coverings by edges of complete bipartite graphs

✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.