A central problem in synthetic geometry is the characterisation of graphs and geometries. The local recognition of locally homogeneous graphs forms one category of such characterisations, which works as follows: Let Δ be a graph. A graph Γ is called locally Δ if for each vertex x of Γ the graph Γx is isomorphic to Δ, where Γx is the induced subgraph of Γ on the set of vertices adjacent to x. It is a natural question to ask for all (connected) graphs, which are locally some graph Δ. This classification question is called the local recognition problem for graphs that are locally Δ, which can be found in great quantities in the literature. One of the earliest and most influential is [1]. The present thesis solves a number of open local recogni...
We establish natural bijections between three different classes of combinatorial objects; namely cer...
AbstractA 2-geodesic in a graph is a vertex triple (u,v,w) such that v is adjacent to both u and w a...
We investigate the properties of graphs which are homogeneous in the sense of Fraisse when consider...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
Let n ≥ 7 and let V be an (n + 2)-dimensional vector space endowed with an anisotropic sesquil...
Abstract. Let P be a projective space. By H(P) we denote the graph whose vertices are the non-incide...
AbstractLet P be a class of graphs; a graph Γ with vertex set V is locally P-homogeneous if whenever...
Abstract. Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which ar...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
AbstractA proper vertex-colouring of a graph G is said to be locally identifying if for any pair u, ...
A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u, v of adj...
AbstractWe define a locally grid graph as a graph in which the structure around each vertex is a 3×3...
Motivated by Felix Klein’s notion that geometry is governed by its group of symme-try transformation...
The universal cover T G of a connected graph G is the unique (possible infinite) tree covering G, i....
We establish natural bijections between three different classes of combinatorial objects; namely cer...
AbstractA 2-geodesic in a graph is a vertex triple (u,v,w) such that v is adjacent to both u and w a...
We investigate the properties of graphs which are homogeneous in the sense of Fraisse when consider...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
Let n ≥ 7 and let V be an (n + 2)-dimensional vector space endowed with an anisotropic sesquil...
Abstract. Let P be a projective space. By H(P) we denote the graph whose vertices are the non-incide...
AbstractLet P be a class of graphs; a graph Γ with vertex set V is locally P-homogeneous if whenever...
Abstract. Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which ar...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
AbstractA proper vertex-colouring of a graph G is said to be locally identifying if for any pair u, ...
A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u, v of adj...
AbstractWe define a locally grid graph as a graph in which the structure around each vertex is a 3×3...
Motivated by Felix Klein’s notion that geometry is governed by its group of symme-try transformation...
The universal cover T G of a connected graph G is the unique (possible infinite) tree covering G, i....
We establish natural bijections between three different classes of combinatorial objects; namely cer...
AbstractA 2-geodesic in a graph is a vertex triple (u,v,w) such that v is adjacent to both u and w a...
We investigate the properties of graphs which are homogeneous in the sense of Fraisse when consider...