Home » Author index

Noel, Jonathan A.


Graph Theory » Coloring » Vertex coloring

Choice Number of k-Chromatic Graphs of Bounded Order ★★

Author(s): Noel

Conjecture   If $ G $ is a $ k $-chromatic graph on at most $ mk $ vertices, then $ \text{ch}(G)\leq \text{ch}(K_{m*k}) $.

Keywords: choosability; complete multipartite graph; list coloring

Posted by jnoel12
updated February 2nd, 2013
add new comment
Graph Theory » Coloring » Vertex coloring

Mixing Circular Colourings ★

Author(s): Brewster; Noel

Question   Is $ \mathfrak{M}_c(G) $ always rational?

Keywords: discrete homotopy; graph colourings; mixing

Posted by jnoel12
updated September 22nd, 2012
add new comment
Syndicate content