Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Outerplanar graph (view), 1-planar graph (view), St-planar graph (view), K-outerplanar graph (view)

searching for Planar graph 36 found (309 total)

alternate case: planar graph

Saidur Rahman (professor) (1,006 words) [view diff] case mismatch in snippet view article

University of Engineering and Technology. He is an author of the book Planar Graph Drawing. He is known for his contribution in graph drawing, graph algorithms

Geometric separator (2,388 words) [view diff] exact match in snippet view article find links to article

theorem may be proven by using the circle packing theorem to represent a planar graph as the contact graph of a system of disks in the plane, and then by finding

Acyclic coloring (720 words) [view diff] exact match in snippet view article find links to article

to a conjecture of Grünbaum: Theorem (Borodin 1979) A(G) ≤ 5 if G is planar graph. Grünbaum (1973) introduced acyclic coloring and acyclic chromatic number

Delta-matroid (518 words) [view diff] exact match in snippet view article find links to article

constraint satisfaction problem has a Boolean variable on each edge of a planar graph, and if the variables of the edges incident to each vertex of the graph

Maekawa's theorem (312 words) [view diff] exact match in snippet view article find links to article

folds at each vertex must be an even number. This implies (via a form of planar graph duality between Eulerian graphs and bipartite graphs) that, for any flat-foldable

Tangent circles (358 words) [view diff] exact match in snippet view article find links to article

Tangent lines to circles Circle packing theorem, the result that every planar graph may be realized by a system of tangent circles Hexafoil, the shape formed

Wolfgang Haken (574 words) [view diff] exact match in snippet view article find links to article

Urbana-Champaign, Haken solved the four-color problem: they proved that any planar graph can be properly colored using at most four colors. Haken has introduced

Neil Robertson (mathematician) (747 words) [view diff] exact match in snippet view article

Neil; Seymour, P. D (2003-09-01). "Graph Minors. XVI. Excluding a non-planar graph". Journal of Combinatorial Theory, Series B. 89 (1): 43–76. doi:10

Separation theorem (258 words) [view diff] exact match in snippet view article find links to article

future" form. Planar separator theorem (graph theory) states that any planar graph can be split into smaller pieces by removing a small number of vertices

Combinatorial class (608 words) [view diff] exact match in snippet view article find links to article

combinatorial classes. A bijective isomorphism in this case is given by planar graph duality: a triangulation can be transformed bijectively into a tree with

Douglas West (mathematician) (203 words) [view diff] exact match in snippet view article

Part II, DB West - Discrete Mathematics, 1982. The interval number of a planar graph: three intervals suffice, ER Scheinerman, DB West - Journal of combinatorial

Arf invariant of a knot (741 words) [view diff] exact match in snippet view article find links to article

invariant can be obtained by taking the partition function of a signed planar graph associated to a knot diagram.[citation needed] This approach to the Arf

Topological graph (3,579 words) [view diff] exact match in snippet view article find links to article

graph is 2-quasi-planar, then it is a planar graph. It follows from Euler's polyhedral formula that every planar graph with n > 2 vertices has at most 3n − 6

Heiko Harborth (533 words) [view diff] exact match in snippet view article find links to article

contain any of the other points. Harborth's conjecture posits that every planar graph admits a straight-line embedding in the plane where every edge has integer

Bag (puzzle) (342 words) [view diff] exact match in snippet view article

by reducing the decision problem of deciding the 3-colorability of a planar graph, which is known to be NP-complete, to a Corral Puzzle. List of Nikoli

Dual matroid (972 words) [view diff] exact match in snippet view article find links to article

only if the underlying graph is planar; the matroid of the dual of a planar graph is the same as the dual of the matroid of the graph. Thus, the family

Virtual knot (784 words) [view diff] exact match in snippet view article find links to article

3-dimensional Euclidean space. A virtual knot diagram is a 4-valent planar graph, but each vertex is now allowed to be a classical crossing or a new type

McCabe–Thiele method (870 words) [view diff] exact match in snippet view article find links to article

its liquid form—for the component with the lower boiling point. On a planar graph, both axes represent the mole fractions of the lighter (lower boiling)

Richard M. Pollack (827 words) [view diff] exact match in snippet view article find links to article

Fraysseix, Hubert; Pach, János; Pollack, Richard (1990), "How to draw a planar graph on a grid", Combinatorica, 10: 41–51, doi:10.1007/BF02122694, S2CID 6861762

W. T. Tutte (4,696 words) [view diff] exact match in snippet view article find links to article

matroid is a graphic matroid. The algorithm makes use of the fact that a planar graph is simply a graph whose circuit-matroid, the dual of its bond-matroid

Philip N. Klein (638 words) [view diff] exact match in snippet view article find links to article

linear-time algorithm to find a nearly optimal traveling salesman tour in a planar graph. Klein has published two textbooks: Klein, Philip N. (2014). A cryptography

Chinese postman problem (1,297 words) [view diff] exact match in snippet view article find links to article

to the Chinese Postman Problem, including finding a maximum cut in a planar graph and a minimum-mean length circuit in an undirected graph. A few variants

Geometric spanner (1,180 words) [view diff] exact match in snippet view article find links to article

University Press, ISBN 978-0-521-81513-0. Chew, L. Paul (1986), "There is a planar graph almost as good as the complete graph", Proc. 2nd Annual Symposium on

Neutral network (evolution) (2,832 words) [view diff] exact match in snippet view article

algorithm described the folding problem over a two letter alphabet as a planar graph optimization problem, where the quantity to be maximized is the number

Parallel redrawing (583 words) [view diff] exact match in snippet view article find links to article

Anna; Petrick, Mark; Spriggs, Michael (2013), "Morphing orthogonal planar graph drawings", ACM Transactions on Algorithms, 9 (4): Art. 29, 24, doi:10

Hadwiger conjecture (graph theory) (2,414 words) [view diff] exact match in snippet view article

1017/S0305004100061521, MR 0735367, S2CID 124801301 Thomassen, Carsten (1994), "Every planar graph is 5-choosable", Journal of Combinatorial Theory, Series B, 62 (1): 180–181

Fano plane (3,102 words) [view diff] exact match in snippet view article find links to article

The Fano plane redrawn as a planar graph

Interval edge coloring (1,659 words) [view diff] exact match in snippet view article find links to article

For any m,n∈N, K1,m,n ∈ N if and only if gcd(m+1, n+1) = 1. If G is a planar graph on n vertices then the maximal number of colors used in an interval coloring

Knot theory (6,298 words) [view diff] exact match in snippet view article find links to article

diagram of the link. Start with a basic polyhedron, a 4-valent connected planar graph with no digon regions. Such a polyhedron is denoted first by the number

Neo-Riemannian theory (2,915 words) [view diff] exact match in snippet view article find links to article

typically assumes enharmonic equivalence (G♯ = A♭), which wraps the planar graph into a torus. Alternate tonal geometries have been described in neo-Riemannian

De Bruijn–Erdős theorem (graph theory) (3,632 words) [view diff] exact match in snippet view article

theorem from finite planar graphs to infinite planar graphs. Every finite planar graph can be colored with four colors, by the four-color theorem. The De Bruijn–Erdős

Van Kampen diagram (3,201 words) [view diff] exact match in snippet view article find links to article

1-skeleton of D {\displaystyle {\mathcal {D}}\,} is a finite connected planar graph Γ embedded in R 2 {\displaystyle \mathbb {R} ^{2}\,} and the two-cells

No-three-in-line problem (3,842 words) [view diff] exact match in snippet view article find links to article

Stephen G.; Lubiw, Anna; Mitchell, Joseph S. B. (2007). "On simultaneous planar graph embeddings". Computational Geometry. 36 (2): 117–130. doi:10.1016/j.comgeo

Flip distance (1,409 words) [view diff] exact match in snippet view article find links to article

maximal planar graphs on a sphere can be transformed to any other maximal planar graph with the same vertices through flipping. A. K. Dewdney generalized this

Arc routing (4,812 words) [view diff] exact match in snippet view article find links to article

to the Chinese Postman Problem, including finding a maximum cut in a planar graph and a minimum-mean length circuit in an undirected graph. In winter a

List of RNA structure prediction software (8,490 words) [view diff] exact match in snippet view article find links to article

intra-/intermolecular base pairing of two interacting RNAs with sequence logos in a planar graph. web server / sourcecode VARNA A tool for the automated drawing, visualization