18 search results - page 1 / 4 » Strongly adjacency-transitive graphs and uniquely shift-tran... |
DM
2002
13 years 4 months ago
2002
GC
2006
Springer
13 years 4 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
COMBINATORICS
2000
13 years 4 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
ENDM
2007
13 years 4 months ago
2007
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
COMBINATORICA
2008
13 years 4 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...