Can I read Homomorphisms from Sparse Graphs with Large Girth on EtoBox?

Homomorphisms from Sparse Graphs with Large Girth by O.V. Borodin; S.-J. Kim; A.V. Kostochka; D.B. West is a Computer Science article available to read on EtoBox.

What is Homomorphisms from Sparse Graphs with Large Girth about?

We show that a planar graph with girth at least 20tÀ2 3 has circular chromatic number at most 2 þ 1 t ; improving earlier results. This follows from a general result establishing homomorphisms into special targets for graphs with given girth and given maximum average degree. Other applications concern oriented chromatic number and homomorphisms into mixed graphs with colored edges.

Who reads Homomorphisms from Sparse Graphs with Large Girth?

Author

O.V. Borodin; S.-J. Kim; A.V. Kostochka; D.B. West

Publisher

Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0095-8956)

Published

2004

Language

EN

Field

Computer Science (Physical Sciences)