AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree for G, then the complement of the edges dual to T is a spanning tree for G∗. The purpose of this note is to show how ideas of Edmonds [1], Gustin [2], and Youngs [3] can be used to formulate precisely the generalization of this result to graphs imbedded in any orientable surface. In the course of the work several new interpretations of standard graph-theory concepts will be presented
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable ...
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable ...
AbstractWe prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected...
AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree f...
Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spannin...
AbstractIn 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph m...
AbstractDeo and Micikevicius recently gave a new bijection for spanning trees of complete bipartite ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. ...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a ...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
In Graph Minors III, Robertson and Seymour write:“It seems that the tree-width of a planar graph and...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable ...
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable ...
AbstractWe prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected...
AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree f...
Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spannin...
AbstractIn 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph m...
AbstractDeo and Micikevicius recently gave a new bijection for spanning trees of complete bipartite ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
A Spanning tree of a graph G is a subgraph that is a tree which concludes all of the vertices of G. ...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a ...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
In Graph Minors III, Robertson and Seymour write:“It seems that the tree-width of a planar graph and...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable ...
Orderly spanning trees seem to have the potential of becoming a new and promising technique capable ...
AbstractWe prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected...
DOI
Add to ORKG