Edge and vertex operations on upper embeddable graphs
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if Δ(G) ≥ 9, then χ'ₗ(G) = Δ(G) and χ''ₗ(G) = Δ(G)+1. We also show that if Δ(G) ≥ 6, then χ'ₗ(G) ≤ Δ(G)+1 and if Δ(G) ≥ 7, then χ''ₗ(G) ≤ Δ(G)+2. All of these results extend to graphs in the projective plane and when Δ(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-choosability result improves on work of Wang and Lih and of Zhang and Wu. All of our results use the discharging method...
Edge-disjoint Hamilton cycles in 4-regular planar graphs.
Edge-reconstruction of minimally 3-connected planar graphs.
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