307 search results - page 5 / 62 » Finite locally-quasiprimitive graphs |
115
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
114
Voted
SIAMDM
2010
14 years 8 months ago
2010
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
COMBINATORICS
2007
15 years 1 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
112
Voted
CONCUR
2004
Springer
15 years 7 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
111
Voted
COMBINATORICA
2010
14 years 8 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...