A note on circular chromatic number of graphs with large girth and similar problems
Texte intégral
Documents relatifs
† Supported by the Ministry of Science and Technology of Spain, and the European Regional Development Fund (ERDF) under project-BFM-2002-00412 and by the Catalan Research Council
In this section, we describe an algorithm called LargerToSmaller (Alg. 1) which, when given a class of graphs G in which isomorphism can be decided in polynomial time, solves
In the case of structures of bounded treewidth and FO queries (actually even MSO queries with first-order free variables) the model checking problem is also in FPL [Cou90] and there
Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633–646, 2014] proved that there exist split graphs with Dilworth number 2 with
At first sight there is no straightforward common structure in the presented families of minimal circular-imperfect graphs, hence formulating an analogue to the Strong Perfect
The objective of the exercise was to provide high resolution micro-physical measurements of the coastal nucleation mode in order to map the spatial extent of new particle
In this work, a simple forecasting algorithm is developed for latency compensation in indirect interaction using a mouse, based on numerical differentiation.. Several
/ La version de cette publication peut être l’une des suivantes : la version prépublication de l’auteur, la version acceptée du manuscrit ou la version de l’éditeur.. For