Non-Separable and Planar Graphs

DOI10.2307/1989545zbMath0004.13103OpenAlexW4254149069WikidataQ30053175 ScholiaQ30053175MaRDI QIDQ4333930

No author found.

Publication date: 1932

Full work available at URL: https://doi.org/10.2307/1989545

Mathematics Subject Classification ID

Graph theory (05Cxx)

Related Items (48)

Decomposition of 3-connected graphs ⋮ Flots et tensions dans un graphe ⋮ Binary group and Chinese postman polyhedra ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Polytopes, graphs, and complexes ⋮ A dual form of Kuratowski’s theorem ⋮ Subdivision extendibility ⋮ Graph bases and diagram commutativity ⋮ Polytopality and Cartesian products of graphs ⋮ Unnamed Item ⋮ Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges ⋮ Distributed computations in fully-defective networks ⋮ Fair division of graphs and of tangled cakes ⋮ Cumulants asymptotics for the zeros counting measure of real Gaussian processes ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ Graphs with minimum fractional domatic number ⋮ The Gauss Realizability Problem ⋮ On Codimension One Embedding of Simplicial Complexes ⋮ Bounds on the number of cycles of length three in a planar graph ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ Bipartite partial duals and circuits in medial graphs ⋮ Duality of Ends ⋮ A new graph triconnectivity algorithm and its parallelization ⋮ Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes ⋮ Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries ⋮ Unnamed Item ⋮ Iterated networks and the spectra of renormalizable electromechanical systems ⋮ On Boolean characterizations of planarity and planar embeddings of graphs ⋮ Damage attack on complex networks ⋮ The smallest self-dual embeddable graphs in a pseudosurface ⋮ Derivation modules of orthogonal duals of hyperplane arrangements ⋮ A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids ⋮ Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning ⋮ Describing quasi-graphic matroids ⋮ Alcuni sviluppi sulla teoria relativa dei singrammi finiti ⋮ Formulations and valid inequalities of the node capacitated graph partitioning problem ⋮ Small Subgraphs in Random Distance Graphs ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Matroids and Graphs ⋮ Uniformität des Verbandes der Partitionen ⋮ Kernelization of Whitney Switches ⋮ Unnamed Item ⋮ Matroids Determine the Embeddability of Graphs in Surfaces ⋮ The Price of Connectivity in Fair Division ⋮ Polynomial Invariants of Graphs ⋮ Short and Simple Cycle Separators in Planar Graphs ⋮ A one-dimensional Whitney trick and Kuratowski's graph planarity criterion

This page was built for publication: Non-Separable and Planar Graphs