EJC
2010
13 years 5 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
EJC
2010
13 years 5 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
EJC
2010
13 years 5 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
EJC
2010
13 years 5 months ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
EJC
2010
13 years 5 months ago
2010
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
EJC
2010
13 years 5 months ago
2010
EJC
2010
13 years 5 months ago
2010
EJC
2010
13 years 5 months ago
2010
EJC
2010
13 years 5 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...