𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On edge colorings of 1-planar graphs without adjacent triangles

✍ Scribed by Xin Zhang; Guizhen Liu

Book ID
113663281
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
140 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge colorings of complete graphs withou
Edge colorings of complete graphs without tricolored triangles
✍ AndrΓ‘s GyΓ‘rfΓ‘s; GΓ‘bor Simony πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 59 KB

## Abstract We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size

On edge colorings of 1-planar graphs
On edge colorings of 1-planar graphs
✍ Xin Zhang; Jian-Liang Wu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 155 KB
Acyclic edge coloring of triangle-free p
Acyclic edge coloring of triangle-free planar graphs
✍ Manu Basavaraju; L. Sunil Chandran πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 233 KB πŸ‘ 2 views

An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__β€²(__G__). It was conjectured by Al

On -acyclic edge colorings of planar gra
On -acyclic edge colorings of planar graphs
✍ Xin Zhang; Guanghui Wang; Yong Yu; Jinbo Li; Guizhen Liu πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 229 KB