✦ LIBER ✦

Graphs of Acyclic Cubical Complexes

✍ Scribed by Hans-Jürgen Bandelt; Victor Chepoi

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 256 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0010

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

Acyclic orientations of graphs

✍ Richard P. Stanley 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 708 KB

## Let G be a finite graph with p vertices and x its chromatic polynomial. A combinatorial interpretation is given to the positive integer (-l)px(-A), where h is a positive integer, in terms of acyclic orientations of G. In particular, (-l)Px(-1) is the number of acyclic orientations of G. An appl

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′__(_

Acyclic Orientations of Random Graphs

✍ C.M Reidys 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 195 KB

An acyclic orientation of an undirected graph is an orientation of its edges such that the resulting directed graph contains no cycles. The random graph G is a n, p probability space consisting of subgraphs of K that are obtained by selecting each n K -edge with independent probability p. The random

Acyclic colorings of planar graphs

✍ Wayne Goddard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Numbers of cubic graphs

✍ R. W. Robinson; N. C. Wormald 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract The numbers of unlabeled cubic graphs on __p = 2n__ points have been found by two different counting methods, the best of which has given values for __p ≦__ 40.