The Complexity of Colouring by Infinite Vertex Transitive Graphs

Author(s):  
Bruce Bauslaugh
2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.


1994 ◽  
Vol 3 (4) ◽  
pp. 435-454 ◽  
Author(s):  
Neal Brand ◽  
Steve Jackson

In [11] it is shown that the theory of almost all graphs is first-order complete. Furthermore, in [3] a collection of first-order axioms are given from which any first-order property or its negation can be deduced. Here we show that almost all Steinhaus graphs satisfy the axioms of almost all graphs and conclude that a first-order property is true for almost all graphs if and only if it is true for almost all Steinhaus graphs. We also show that certain classes of subgraphs of vertex transitive graphs are first-order complete. Finally, we give a new class of higher-order axioms from which it follows that large subgraphs of specified type exist in almost all graphs.


2013 ◽  
Vol 50 ◽  
pp. 465-477 ◽  
Author(s):  
Primož Potočnik ◽  
Pablo Spiga ◽  
Gabriel Verret

Sign in / Sign up

Export Citation Format

Share Document