AbstractA variety of algebraic relationships between the various objects in the title are obtained. For example, if a graph embedded in the projective plane has only one left-right path, then the number of spanning trees in the graph and its geometric dual have different parities and its medial has an odd number of noncrossing Euler tours
AbstractThe natural orientation that facial walks inherit from one of the two senses of an orientabl...
AbstractWe prove the following theorem, conjectured by K. Mehlhorn: Let G = (V, E) be a planar graph...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractA variety of algebraic relationships between the various objects in the title are obtained. ...
AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree f...
The duality alluded to in the title is that between the faces and vertices of a graph embedded on a ...
AbstractA straight-ahead walk in an embedded Eulerian graph G always passes from an edge to the oppo...
AbstractApart from the classical characterization of Eulerian graphs by Eulerian trails and cycle de...
AbstractWe define a graph M(G) as an intersection graph Ω(F) on the point set V(G) of any graph G. L...
AbstractSamuel W. Bent and Udi Manber have shown that it is NP-complete to decide whether a simple, ...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
A graph G is Eulerian-connected if for any u and v in V ( G ) , G has a spanning ( u , v )...
AbstractA proof is given of the result about binary matroids that implies that a connected graph is ...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractThe natural orientation that facial walks inherit from one of the two senses of an orientabl...
AbstractWe prove the following theorem, conjectured by K. Mehlhorn: Let G = (V, E) be a planar graph...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractA variety of algebraic relationships between the various objects in the title are obtained. ...
AbstractIt is a well-known result that if G and G∗ are dual planar graphs and T is a spanning tree f...
The duality alluded to in the title is that between the faces and vertices of a graph embedded on a ...
AbstractA straight-ahead walk in an embedded Eulerian graph G always passes from an edge to the oppo...
AbstractApart from the classical characterization of Eulerian graphs by Eulerian trails and cycle de...
AbstractWe define a graph M(G) as an intersection graph Ω(F) on the point set V(G) of any graph G. L...
AbstractSamuel W. Bent and Udi Manber have shown that it is NP-complete to decide whether a simple, ...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
A graph G is Eulerian-connected if for any u and v in V ( G ) , G has a spanning ( u , v )...
AbstractA proof is given of the result about binary matroids that implies that a connected graph is ...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractThe natural orientation that facial walks inherit from one of the two senses of an orientabl...
AbstractWe prove the following theorem, conjectured by K. Mehlhorn: Let G = (V, E) be a planar graph...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...