307 search results - page 3 / 62 » Finite locally-quasiprimitive graphs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
INFORMATICALT
2000
13 years 5 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
JCT
2010
13 years 4 months ago
2010
EJC
2008
13 years 4 months ago
2008
Let be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of . This paper aims to characterize (, G) under the conditions that the quotient gr...
SIAMDM
2010
13 years 15 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...