𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homomorphisms and edge-colourings of planar graphs

✍ Scribed by Reza Naserasr

Book ID
108167416
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
136 KB
Volume
97
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

About acyclic edge colourings of planar
About acyclic edge colourings of planar graphs
✍ Anna Fiedorowicz; Mariusz HaΕ‚uszczak; Narayanan Narayanan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 180 KB
List colourings of planar graphs
List colourings of planar graphs
✍ Margit Voigt πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 259 KB

A graph G = G( V, E) is called L-list colourable if there is a vertex colouring of G in which the colour assigned to a vertex u is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(u) have the cardinality k and G is L-list colourable for all possible assignm

Total Colourings of Planar Graphs with L
Total Colourings of Planar Graphs with Large Girth
✍ O.V. Borodin; A.V. Kostochka; D.R. Woodall πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 96 KB

It is proved that if G is a planar graph with total (vertex-edge) chromatic number Ο‡ , maximum degree and girth g, then Ο‡ = + 1 if β‰₯ 5 and g β‰₯ 5, or β‰₯ 4 and g β‰₯ 6, or β‰₯ 3 and g β‰₯ 10. These results hold also for graphs in the projective plane, torus and Klein bottle.

Edge-transitive planar graphs
Edge-transitive planar graphs
✍ Branko GrΓΌnbaum; G. C. Shephard πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 590 KB