Planarity and duality of finite and infinite graphs

From MaRDI portal
Publication:1142781

DOI10.1016/0095-8956(80)90083-0zbMath0441.05023OpenAlexW2081599503MaRDI QIDQ1142781

Carsten Thomassen

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



Related Items

A construction of 3-connected graphs, On infinite graphs with a primitive automorphism group, Contractible edges in triangle-free graphs, A decomposition theory for matroids. II. Minimal violation matroids, Obstructions to directed embeddings of Eulerian digraphs in the plane, Outer 1-planar graphs, Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density, Construction of crossing-critical graphs, An extension of Whitney's theorem to infinite strong triangulations, One-way infinite Hamiltonian paths in infinite maximal planar graphs, Polygons with Prescribed Angles in 2D and 3D, Minimal locally cyclic triangulations of the projective plane, The 3‐connected graphs with a maximum matching containing precisely one contractible edge, Non-contractible edges in a 3-connected graph, A matrix characterization of induced paths in bridge graphs, Plane Cubic Graphs with Prescribed Face Areas, Color-critical graphs on a fixed surface, A longest cycle version of Tutte's wheels theorem, Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs, Deformations of plane graphs, On contractible and vertically contractible elements in 3-connected matroids and graphs, Drawing planar graphs using the canonical ordering, Algorithms for plane representations of acyclic digraphs, Gap strings and spanning forests for bridge graphs of biconnected graphs, On convex embeddings of planar 3-connected graphs, Spanning quadrangulations of triangulated surfaces, A matrix analysis of carrier posets of biconnected graphs, Canonical forms for cycles in bridge graphs, On-line convex planarity testing, Non-separating induced cycles in graphs, 2-linked graphs, Non-separating cycles and discrete Jordan curves, Embeddings of graphs with no short noncontractible cycles, Characterising planar Cayley graphs and Cayley complexes in terms of group presentations, Duality of infinite graphs, 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., Chromatic number, induced cycles, and non-separating cycles, Duality of Ends, Dual trees must share their ends, Percolation, perimetry, planarity, On 3-connected graphs with contractible edge covers of size \(k\), Algebraic flow theory of infinite graphs, Drawing the planar dual, On obstructions to small face covers in planar graphs, MacLane's planarity criterion for locally finite graphs, The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits, Partial matroid representations, Graph-like spaces: an introduction, Locally finite graphs with ends: A topological approach. I: Basic theory, An extremal problem on contractible edges in 3-connected graphs, A recursive characterization of the 4-connected graphs, Cycle double covers of infinite planar graphs, Entropy-driven phase transition in low-temperature antiferromagnetic Potts models, Hamilton circles in infinite planar graphs, An obstruction to embedding graphs in surfaces, Planar acyclic oriented graphs, A characterization of infinite planar primitive graphs, Unnamed Item, Crossing-critical edges and Kuratowski subgraphs of a graph, \([2,3\)-factors in a 3-connected infinite planar graph.], Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles, The 2-linkage problem for acyclic digraphs, Drawing plane graphs nicely, Incremental convex planarity testing, Polygons with Prescribed Angles in 2D and 3D, Distribution of contractible elements in 2-connected matroids, A refinement of Kuratowski's theorem, Convex representations of maps on the torus and other flat surfaces, On the cycle space of an infinite 3-connected graph, The boundary of a square tiling of a graph coincides with the Poisson boundary



Cites Work