Sciweavers

307 search results - page 5 / 62
» Finite locally-quasiprimitive graphs
Sort
View
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
14 years 11 months ago
The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
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...
T. R. Riley, William P. Thurston
SIAMDM
2010
109views more  SIAMDM 2010»
14 years 6 months ago
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
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...
Maya Stein
64
Voted
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
14 years 11 months ago
Recognizing Cluster Algebras of Finite Type
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven
CONCUR
2004
Springer
15 years 5 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
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 ...
Paolo Baldan, Andrea Corradini, Barbara König
COMBINATORICA
2010
14 years 6 months ago
The homology of a locally finite graph with ends
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...
Reinhard Diestel, Philipp Sprüssel