Skip to search formSkip to main contentSkip to account menu

Squaregraph

Known as: Quadrangulation 
In graph theory, a branch of mathematics, a squaregraph is a type of undirected graph that can be drawn in the plane in such a way that every bounded… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AlgorithmFace (geometry)Forbidden graph characterizationGraph drawing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Reducing quadrangulations of the sphere and the projective plane
We show that every quadrangulation of the sphere can be transformed into a $4$-cycle by deletions of degree-$2$ vertices and by… 
2015
2015
Stokes posets and serpent nests
We study two different objects attached to an arbitrary quadrangulation of a regular polygon. The first one is a poset, closely… 
2012
2012
High order non-conforming multi-element discontinuous Galerkin method for time-domain electromagnetics
2011
2011
Generic Ising trees
The Ising model on a class of infinite random trees is defined as a thermodynamic limit of finite systems. A detailed description… 
2011
2011
The Hausdorff Dimension of Two-Dimensional Quantum Gravity
We argue that the Hausdorff dimension D of a quantum gravity random surface is always D=4, irrespective of the conformal central… 
2011
2011
Etude asymptotique de grands objets combinatoires aléatoires
Dans ce travail, nous nous sommes interesses a l'etude asymptotique d'objets combinatoires aleatoires. Deux themes ont… 
2009
2009
Dimensions of Bivariate Quintic Spline Spaces over Generalized Type-II Triangulations
In this paper, a class of four-corner quadrangulation is introduced, which is homeomorphic to a rectangular partition of a… 
2008
2008
Coloring even-faced graphs in the torus and the Klein bottle
We prove that a triangle-free graph drawn in the torus with all faces bounded by even walks is 3-colorable if and only if it has… 
2006
2006
Quadrangulations and 5-critical Graphs on the Projective Plane
Let Q be a nonbipartite quadrangulation of the projective plane. Youngs [You96] proved that Q cannot be 3-colored. We prove that… 
1995
1995
No Quadrangulation is Extremely Odd
Given a set S of n points in the plane, a quadrangulation of S is a planar subdivision whose vertices are the points of S, whose… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)