Edge-transitive maps and non-orientable surfaces
Efficient counting and asymptotics of -noncrossing tangled diagrams.
Ein planarer hypohamiltonscher Graph mit 57 Knoten.
Ein Planaritätskriterium für endliche Graphen.
Ein Planaritätstest für planar-konvexe Grapheneinbettungen mit linearer Komplexität
Eine Verallgemeinerung der Färbungszahlen.
Eine Verallgemeinerung der Färbungszahlen. II.
Elimination of local bridges
Embedding graphs in their complements
Embedding -quasistars into -cubes
Embedding the polytomic tree into the -cube
Embedding trees into block graphs
Embedding trees into clique-bridge-clique graphs
Embeddings of Graphs in Euclidean Spaces.
Enumeration and asymptotic properties of unlabeled outerplanar graphs.
Énumération des cartes pointées sue la bouteille de Klein
Equations relating factors in decompositions into factors of some family of plane triangulations, and applications (with an appendix by Andrzej Schinzel)
Let be the family of all 2-connected plane triangulations with vertices of degree three or six. Grünbaum and Motzkin proved (in dual terms) that every graph P ∈ has a decomposition into factors P₀, P₁, P₂ (indexed by elements of the cyclic group Q = 0,1,2) such that every factor consists of two induced paths of the same length M(q), and K(q) - 1 induced cycles of the same length 2M(q). For q ∈ Q, we define an integer S⁺(q) such that the vector (K(q),M(q),S⁺(q)) determines the graph P (if P is...
Establishing Order in Planar Subdivisions.
Existence and nonexistence of universal graphs
Existence of perfect matchings in a plane bipartite graph
We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the paper of F. Zhang, R. Chen and X. Guo (1985).