A structural characterization of planar combinatorial graphs
From MaRDI portal
Publication:2645931
DOI10.1215/S0012-7094-37-00336-3zbMath0017.42702OpenAlexW2025214096WikidataQ29999551 ScholiaQ29999551MaRDI QIDQ2645931
Publication date: 1937
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/s0012-7094-37-00336-3
Related Items (27)
Decomposition of 3-connected graphs ⋮ Flots et tensions dans un graphe ⋮ Ranking and unranking planar embeddings ⋮ Edge-packing planar graphs by cyclic graphs ⋮ A polyhedral theory on graphs ⋮ Obstructions for the Disk and the Cylinder Embedding Extension Problems ⋮ The decomposition tree of a biconnected graph ⋮ Unnamed Item ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ The use of tree transducers to compute translations between graph algebras ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ Using SPQR-trees to speed up recognition algorithms based on 2-cutsets ⋮ The decomposition of graphs into \(k\)-connected components ⋮ Discrete characterizations of planarity part I: the classical viewpoint ⋮ On Boolean characterizations of planarity and planar embeddings of graphs ⋮ Structure and enumeration of two-connected graphs with prescribed three-connected components ⋮ Canonical decompositions of symmetric submodular systems ⋮ Normalformen planarer Graphen. II ⋮ ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES ⋮ Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs ⋮ Finding triconnected components of graphs ⋮ Blocks in \(k\)-connected graphs ⋮ k-connectivity in random undirected graphs ⋮ An approach to the subgraph homeomorphism problem ⋮ On counting planar embeddings ⋮ Cubic combinatorial maps
This page was built for publication: A structural characterization of planar combinatorial graphs
