Non-Separable and Planar Graphs
From MaRDI portal
Cited in
(61)- Bounds on the number of cycles of length three in a planar graph
- A new graph triconnectivity algorithm and its parallelization
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- Damage attack on complex networks
- The smallest self-dual embeddable graphs in a pseudosurface
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Polytopality and Cartesian products of graphs
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- On Boolean characterizations of planarity and planar embeddings of graphs
- Describing quasi-graphic matroids
- Decomposition of 3-connected graphs
- Graph bases and diagram commutativity
- Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes
- Derivation modules of orthogonal duals of hyperplane arrangements
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Alcuni sviluppi sulla teoria relativa dei singrammi finiti
- Uniformität des Verbandes der Partitionen
- A wheels-and-whirls theorem for 3-connected 2-polymatroids
- Small subgraphs in random distance graphs
- Mondshein sequences (a.k.a. (2,1)-orders)
- Matroids and Graphs
- Edges and Kuratowski Subgraphs of Non-Planar Graphs
- Connected Plane Sets which Contain no Nondegenerate Connected Simple Graph
- Duality of ends
- scientific article; zbMATH DE number 5543080 (Why is no real title available?)
- Binary group and Chinese postman polyhedra
- Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
- Matroids Determine the Embeddability of Graphs in Surfaces
- Polynomial Invariants of Graphs
- scientific article; zbMATH DE number 19813 (Why is no real title available?)
- On codimension one embedding of simplicial complexes
- 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
- scientific article; zbMATH DE number 7359764 (Why is no real title available?)
- Kernelization of Whitney switches
- Truly non-trivial graphoidal graphs
- Connectivity of the planar graph with highly reliable edges
- scientific article; zbMATH DE number 6438262 (Why is no real title available?)
- Short and simple cycle separators in planar graphs
- A dual form of Kuratowski’s theorem
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- Flots et tensions dans un graphe
- The Gauss Realizability Problem
- Polytopes, graphs, and complexes
- scientific article; zbMATH DE number 3375554 (Why is no real title available?)
- Iterated networks and the spectra of renormalizable electromechanical systems
- The price of connectivity in fair division
- Fair division of graphs and of tangled cakes
- Cumulants asymptotics for the zeros counting measure of real Gaussian processes
- Graphs with minimum fractional domatic number
- Reeb graphs of Morse-Bott functions on a given surface
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- On left-orderability of involutory quandles of links
- The next smallest self-dual embeddable graphs in pseudosurfaces
- The decycling number of a planar graph covered by K₄-subgraphs
- A note on the 2-factor Hamiltonicity conjecture
- The structure of minimum vertex cuts
- The cycle counts of graphs
- A one-dimensional Whitney trick and Kuratowski's graph planarity criterion
- Subdivision extendibility
This page was built for publication: Non-Separable and Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4333930)
