2487 search results - page 164 / 498 » Partitions of Graphs into Trees |
77
Voted
IPL
2006
15 years 3 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
141
click to vote
JCB
2006
15 years 3 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
125
Voted
JCO
2007
15 years 3 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
142
click to vote
JGT
2007
15 years 3 months ago
2007
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
126
Voted
DM
1999
15 years 3 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...