7 research outputs found
Planar Graphs with Circular Chromatic Numbers between 3 and 4
AbstractThis paper proves that for every rational number r between 3 and 4, there exists a planar graph G whose circular chromatic number is equal to r. Combining this result with a recent result of Moser, we arrive at the conclusion that every rational number r between 2 and 4 is the circular chromatic number of a planar graph
Digraphs and homomorphisms: Cores, colorings, and constructions
A natural digraph analogue of the graph-theoretic concept of an `independent set\u27 is that of an acyclic set, namely a set of vertices not spanning a directed cycle. Hence a digraph analogue of a graph coloring is a decomposition of the vertex set into acyclic sets
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM
Avances en Matemática Discreta en AndalucĂa. V Encuentro andaluz de Matemática Discreta. La LĂnea de la ConcepciĂłn (Cádiz), 4-5 de julio de 2007
V Encuentro andaluz de Matemática Discreta. La LĂnea de la ConcepciĂłn (Cádiz), 4-5 de julio de 200