Home » Author index

Ghebleh, Mohammad


Graph Theory » Coloring » Vertex coloring

Circular colouring the orthogonality graph ★★

Author(s): DeVos; Ghebleh; Goddyn; Mohar; Naserasr

Let $ {\mathcal O} $ denote the graph with vertex set consisting of all lines through the origin in $ {\mathbb R}^3 $ and two vertices adjacent in $ {\mathcal O} $ if they are perpendicular.

Problem   Is $ \chi_c({\mathcal O}) = 4 $?

Keywords: circular coloring; geometric graph; orthogonality

Posted by mdevos
updated September 28th, 2009
4 comments
Graph Theory » Coloring » Vertex coloring

Circular coloring triangle-free subcubic planar graphs ★★

Author(s): Ghebleh; Zhu

Problem   Does every triangle-free planar graph of maximum degree three have circular chromatic number at most $ \frac{20}{7} $?

Keywords: circular coloring; planar graph; triangle free

Posted by mdevos
updated June 20th, 2007
add new comment
Syndicate content