DM
2010
13 years 11 months ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
DM
2010
13 years 11 months ago
2010
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...
DM
2010
13 years 11 months ago
2010
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
Alon, Bollob
DM
2010
13 years 11 months ago
2010
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimensio...
DM
2010
13 years 11 months ago
2010
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
DM
2010
13 years 11 months ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...