Planarity and duality of finite and infinite graphs
From MaRDI portal
Publication:1142781
DOI10.1016/0095-8956(80)90083-0zbMath0441.05023MaRDI QIDQ1142781
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90083-0
duality; Whitney; infinite graphs; finite graphs; planarity criteria; Fournier; Kuratowski; MacLane; Tutte
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Minimal locally cyclic triangulations of the projective plane, The 3‐connected graphs with a maximum matching containing precisely one contractible edge, A matrix characterization of induced paths in bridge graphs, Plane Cubic Graphs with Prescribed Face Areas, A matrix analysis of carrier posets of biconnected graphs, Canonical forms for cycles in bridge graphs, Unnamed Item, Representations of graphs and networks (coding, layouts and embeddings), Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)], A variational principle for circle packings., On 3-connected graphs with contractible edge covers of size \(k\), Drawing the planar dual, On obstructions to small face covers in planar graphs, Convex representations of maps on the torus and other flat surfaces, A construction of 3-connected graphs, On infinite graphs with a primitive automorphism group, An extension of Whitney's theorem to infinite strong triangulations, One-way infinite Hamiltonian paths in infinite maximal planar graphs, Color-critical graphs on a fixed surface, A longest cycle version of Tutte's wheels theorem, On contractible and vertically contractible elements in 3-connected matroids and graphs, Non-contractible edges in a 3-connected graph, Drawing planar graphs using the canonical ordering, Gap strings and spanning forests for bridge graphs of biconnected graphs
