𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Change graphs of edge-colorings of planar cubic graphs

✍ Scribed by Anton Kotzig

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
291 KB
Volume
22
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal acyclic edge-coloring of cubic g
Optimal acyclic edge-coloring of cubic graphs
✍ Lars Døvling Andersen; Edita Máčajová;; Ján Mazák 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

An __acyclic edge‐coloring__ of a graph is a proper edge‐coloring such that the subgraph induced by the edges of any two colors is acyclic. The __acyclic chromatic index__ of a graph __G__ is the smallest number of colors in an acyclic edge‐coloring of __G__. We prove that the acyclic chromatic inde

On the Number of 3-Edge Colorings of Cub
On the Number of 3-Edge Colorings of Cubic Graphs
✍ Christian Szegedy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221-244 on the number of 3-edge colorings of a plane cubic gr

Acyclic edge colorings of graphs
Acyclic edge colorings of graphs
✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_

Strong edge colorings of graphs
Strong edge colorings of graphs
✍ Odile Favaron; Hao Li; R.H. Schelp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Let x'(G), called the strong coloring number of G, denote the minimum number of colors for which there is a proper edge coloring of a graph G in which no two of its vertices is incident to edges colored with the same set of colors. It is shown that Z'~(G) ~< Fcn], ½ < c ~ 1, whenever A(G) is appropr

Hamiltonian weights and unique 3-edge-co
Hamiltonian weights and unique 3-edge-colorings of cubic graphs
✍ Cun-Quan Zhang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract A (1,2)‐eulerian weight __w__ of a grph is hamiltonian if every faithful cover of __w__ is a set of two Hamilton circuits. Let __G__ be a 3‐connected cubic graph containing no subdivition of the Petersen graph. We prove that if __G__ admits a hamiltonian weight then __G__ is uniquely 3‐