Oriented cliques and colorings of graphs with low maximum degree

† 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

Thus the number of labelled simple ∆-regular graphs on n vertices is at most the number of labelled graphs with n vertices, 1 2 ∆n edges, and queue-number at most k...

(A set of points in the plane is in convex position if it forms the vertex-set of a convex polygon.) We then consider the flip graph on the perfect matchings of a complete graph of

We shall give general bounds on the upper and ordinary oriented chromatic numbers of lexicographic, strong, Cartesian and direct products of undirected and oriented graphs, with

Keywords: non-equivalent colorings; graphical Bell number; extremal theory; fixed maximum degree..

In choosing Communism as the western- izing vehicle they rejected Protestant and Catholic influences, scholastic, pietist and modernist.. Liberalism and democratic socialism

To further characterize the ligand binding mode, we used Microscale Thermophoresis to determine the affinity of ENDO-WT and mutants ENDO-D88A and ENDO-D118A for DPBA (1) and

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