Mapping planar graphs into the Coxeter graph

8 years 1 months ago

Download people.maths.ox.ac.uk

We conjecture that every planar graph of odd-girth at least 11 admits a homomorphism to the Coxeter graph. Supporting this conjecture, we prove that every planar graph of odd-girth at least 17 admits a homomorphism to the Coxeter graph.

Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevs

Real-time Traffic

DM 2016 |

claim paper

» Enumerative Properties of Rooted Circuit Maps

» Planar Graphs via WellOrderly Maps and Trees

» PlanarityPreserving Clustering and Embedding for Large Planar Graphs

» FixedParameter Algorithms for the k rCenter in Planar Graphs and Map Graphs

» Recognizing HoleFree 4Map Graphs in Cubic Time

» Map graphs

» Homomorphisms and edgecolourings of planar graphs

» Universal Sets of n Points for 1Bend Drawings of Planar Graphs with n Vertices

» Universal Sets of n Points for Onebend Drawings of Planar Graphs with n Vertices

Post Info
More Details (n/a)

Added	01 Apr 2016
Updated	01 Apr 2016
Type	Journal
Year	2016
Where	DM
Authors	Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun

Comments (0)

Sciweavers

Mapping planar graphs into the Coxeter graph

DM 2016 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers