Characterizes minor-minimal separating projective planar graphs and their generalizations.
problem Understanding projective planar graphs and their properties.
method Analyzing minors, embeddings, and specific link types.
result Partial characterization of minor-minimal separating projective planar graphs and their generalizations.
Study examines how changing regions affects planar graphs.
problem Effect of region crossing change on planar trivalent graphs.
method Investigation of region crossing changes on planar trivalent graphs.
result Effect of region crossing change on planar trivalent graphs.
Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.
problem Quasi-transitive graphs quasi-isometric to planar graphs need to be upgraded to Cayley graphs.
method Upgrading a planar graph to a Cayley graph.
result Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.
Study on planar graph braid groups' second homology.
problem Characterize the second homology of planar graph braid groups.
method Analyzing configuration spaces of planar graphs under specific operations.
result The second homology is generated by three specific graphs.
New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.
problem Understanding linkability and knotability of graph complements.
method Using maximal non-separating planar graphs to construct examples of maximal linkless and knotless graphs, and analyzing their Colin de Verdière invariant.
result The Colin de Verdière invariant of the complement of a maximal non-separating planar graph satisfies μ(cG) ≤ n-4, and equality holds.
The complement of a non-separating planar graph contains a K_n minor.
problem Characterizing the structure of complements of planar graphs.
method Analyzing the structure of complements of non-separating planar graphs and using examples to illustrate hypotheses.
result The order 2n-3 is the lowest possible for a non-separating planar graph whose complement contains a K_n minor.
Study on planar graphs in Poincare model of hyperbolic geometry.
problem Investigating Morse flows on a 2-disk using planar graphs.
method Using planar graphs and spherical graphs to describe topological structures.
result Listed all planar graphs with at least 3 edges and described those with 4 edges.
String graphs are closely related to planar graphs in terms of distances.
problem Understanding the relationship between string graphs and planar graphs.
method Proved quasi-isometric relationship between string graphs and planar graphs.
result String graphs are quasi-isometric to planar graphs.
The study extends Tutte's conflict graph concept to nonplanar graphs.
problem Understanding the structure of nonplanar graphs through conflict graphs.
method Defining a signed conflict graph for maximally planar subgraphs and analyzing their balance.
result For graphs with a flat embedding, every maximal planar subgraph has unbalanced conflict graphs if and only if the graph is intrinsically linked.
Spatial graphs are decomposed into planar forests and braids.
problem Understanding the structure of spatial graphs in 3-space.
method Decomposition of spatial graphs into planar forests and braids.
result Every finite spatial graph is a connected sum of a planar graph and a braid.
In his 1930 paper, Kuratowksi categorized planar graphs, proving that a finite graph Γ is planar if and only if it does not contain a subgraph that is homeomorphic to K5, the complete graph on 5 vertices, or K3,3, the complete bipartite graph on six vertices. In their 2001 paper, Davis and Okun point out that…
Proves planar graphs' configuration spaces have highest topological complexity.
problem Proving Farber's conjecture for planar graphs.
method Generic maximality argument for topological complexities.
result Generic maximality of topological complexities for planar graphs.
A graph is apex if it can be made planar by deleting a vertex, that is, ∃v such that G−v is planar. We define the related notions of edge apex, ∃e such that G−e is planar, and contraction apex, ∃e such that G/e is planar, as well as the analogues with a universal quantifier: ∀v…
Sharp bounds for spanning tree entropy in planar lattices.
problem Estimating spanning tree entropy in planar lattice graphs.
method Using hyperbolic geometry and polyhedra volumes.
result Proved bounds are easy to compute and provide excellent estimates.
Automorphisms of fine curve graphs match surface homeomorphisms for planar surfaces.
problem Understanding automorphisms of fine curve graphs on surfaces.
method Analyzing vertices and edges of fine curve graphs to match with surface homeomorphisms.
result Automorphism group of fine curve graphs is naturally isomorphic to the homeomorphism group of boundaryless planar surfaces with at least 7 punctures.
Study classifies Halin graphs with positive curvature.
problem Classifying Halin graphs with specific curvature.
method Analyzing generalized Halin graphs formed by connecting tree leaves.
result Identified all generalized Halin graphs with positive Lin-Lu-Yau curvature.
The paper shows conflict graphs of Petersen family graphs are mostly unbalanced.
problem Understanding the balance of conflict graphs in Petersen family graphs.
method Analyzing maximally planar subgraphs and their conflict graphs.
result All but three strong conflict graphs from Petersen Family Graphs are unbalanced.
We show that given a trivalent graph in S3, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of Thompson to graphs. It follows that any graph complement always contains a useful p…
Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.
problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.
Asymptotic dimension of planes and graphs is at most three.
problem Understanding the geometric complexity of planes and graphs.
method Analyzing geodesic spaces and their homeomorphisms to subsets in the plane.
result The asymptotic dimension of the plane and any planar graph is at most three.
Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
problem Unknottability of spatial graphs by region crossing changes.
method Region crossing changes to switch over/under relations within regions of spatial graph diagrams.
result Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
We give a description of local and global moves on a class of locally planar trivalent graphs and we show that it contains λ-Scale calculus, therefore in particular untyped lambda calculus. Surprisingly, the beta reduction rule comes from a local "sewing" transformation of trivalent locally planar graphs.
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero. The golden identity for the flow polynomial is conjectured to characterize …
We show that all nontrivial embeddings of planar graphs on the torus contain a nontrivial knot or a nonsplit link. This is equivalent to showing that no minimally knotted planar spatial graphs on the torus exist that contain neither a nontrivial knot nor a nonsplit link all of whose components are unknots.
In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph G a polynomial, denoted [G], in three variables, A, B and a, satisfies the skein relation: $$ [\psdiag{2}{6}{overcross}]=…
Approximates cycles in planar and bounded-genus graphs.
problem Finding many disjoint cycles in planar and bounded-genus graphs.
method Constant-factor approximation algorithms for vertex-disjoint and edge-disjoint cycles.
result First algorithms for vertex-disjoint paths in fully planar and bounded-genus instances.
This paper classifies planar-Rips complexes and their unit disk graphs up to homotopy.
problem Classifying planar-Rips complexes and their unit disk graphs.
method Simplicial classification, homotopy equivalence, and hereditary properties.
result Classification of planar-Rips complexes and unit disk graphs up to homotopy.
We prove that the spectral gap of a finite planar graph X is bounded by $λ_1(X)\le C(\frac{\log(\diam X)}{\diam X})^2$ where C depends only on the degree of X. We then give a sequence of such graphs showing the the above estimate cannot be improved. This yields a negative answer to a question of Benjamini and Cur…
New method realizes planar graphs as Reeb graphs of algebraic functions.
problem Realizing planar graphs as Reeb graphs of algebraic functions.
method Generic embedding and elementary procedures.
result Generically embedded planar graphs are homeomorphic to Reeb graphs of algebraic functions.
We investigate the planarity of the boundaries of right-angled Coxeter groups. We show that non-planarity of the defining graph does not necessarily imply non-planarity of every boundary of the associated right-angled Coxeter group, although it does in many cases. Our techniques yield a characterization of the triangle…
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly infinite---graph with nonnegative combinatorial curvature and positive total curvature is …
We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named `bubbles', that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tre…
Temperley-Lieb algebras have been generalized to sl(3) web spaces. Since a cubic bipartite planar graph with suitable directions on edges is a web, the quantum sl(3) invariants naturally extend to all cubic bipartite planar graphs. First we completely classify them as a connected sum of primes webs. We also provide a m…
We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the first polynomial-time algorithm for c-planarity. C-planarity was introduced in 1995…
Origamis' orbits are non-planar except for a few specific cases.
problem Determining the planarity of origamis' orbits under SL(2,Z) action.
method Analyzing 4-valent graphs from SL(2,Z) action on origamis in H(2).
result Most origamis' orbits are non-planar, with specific exceptions.
Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such planar graph is a checkerboard surface, and each state surface is a fiber if and o…
Moduli space linked to Tait colorings of planar graphs.
problem Understanding Tait colorings of planar graphs.
method Associated a moduli space to a planar trivalent graph and proved decomposition properties.
result The Euler characteristic of M(G) equals the number of Tait colorings of G when G is bipartite.
We prove that the total curvature of any planar graph with nonnegative combinatorial curvature is an integral multiple of 121. As a corollary, this answers a question proposed by T. Réti.
Characterizes graphs with leveled embeddings and introduces new graph invariants.
problem Understanding the properties of leveled embeddings in spatial graphs.
method Characterization of graphs with leveled embeddings, introduction of new invariants.
result Characterization of graphs with low level number and determination of specific invariants for complete graphs and complete bipartite graphs.
The paper defines surface area for graphs and derives spectral estimates.
problem Understanding connectivity measures and spectral properties of graphs.
method Introducing surface area concepts related to inverse degree and deriving spectral bounds.
result An upper bound on the second eigenvalue for planar graphs.
New IPL graphs identified and conditions for their projective embeddings established.
problem Characterizing and identifying intrinsically projectively linked graphs.
method Applying Δ-Y exchanges and analyzing projective planar graphs.
result No minor-minimal IPL graphs on 16 edges exist, and new ones are identified.
We give formulae for the first homology of the n-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the n-braid group over the graph is torsion-free and the conjectures about the first h…
Well-quasi-orders proved on embedded planar graphs.
problem Proving well-quasi-orders on embedded planar graphs.
method Careful analysis and extensions of classical methods for embedded minor relations.
result Embedded minor relations are well-quasi-orders on various classes of embedded planar graphs.
The article proves K5 and K3,3 are toroidal penny graphs.
problem Optimal sphere packing on torus.
method Analyzing connections between planar graphs, penny graphs, and toroidal penny graphs.
result K5 and K3,3 are toroidal penny graphs. The paper refines 2-factor homology to a stable homotopy type for planar trivalent graphs with perfect matchings.
problem Developing a stable homotopy type for planar trivalent graphs with perfect matchings.
method Defining a cover functor from the 2-factor flow category to the cube flow category, realizing the 2-factor spectrum, and showing it's an invariant.
result The stable homotopy type of the 2-factor spectrum is an invariant of planar trivalent graphs with perfect matchings.
The aim of this paper is to clarify the relationship between Gromov-hyperbolicity and amenability for planar maps.
A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space to the 2-space. In this paper we show that if a generic immersion of a planar g…
Paper extends Enami-Ozeki-Yamaguchi's work on planar quadrangulations.
problem Finding the maximum number of colors for proper anti-rainbow colorings on planar quadrangulations.
method Introducing half-monochromatic colorings for plane graphs with even polygonal faces and providing an upper bound in terms of the independence number.
result An upper bound on the maximum number of colors for half-monochromatic colorings is given in terms of the independence number.