3 search results - page 1 / 1 » Lattices of Order-Convex Sets of Forests |
65
Voted
ORDER
2010
14 years 9 months ago
2010
95
Voted
DM
2002
14 years 10 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...