Recent Activity
Fire Kirin Generator Cheats 2024 (FREE!) ★★
Author(s):
Fire Kirin Generator Cheats 2024 (FREE!)
Keywords:
Call Of Duty Mobile Generator Cheats No Human Verification (Without Surveys) ★★
Author(s):
Call Of Duty Mobile Generator Cheats No Human Verification (Without Surveys)
Keywords:
Family Island Generator Cheats 2024 Generator Cheats Tested On Android Ios (extra) ★★
Author(s):
Family Island Generator Cheats 2024 Generator Cheats Tested On Android Ios (extra)
Keywords:
SimCity BuildIt Generator Cheats Unlimited Resources No Jailbreak (Premium Orginal Generator) ★★
Author(s):
SimCity BuildIt Generator Cheats Unlimited Resources No Jailbreak (Premium Orginal Generator)
Keywords:
PK XD Generator Cheats 2024 Generator Cheats Tested On Android Ios (WORKING TIPS) ★★
Author(s):
PK XD Generator Cheats 2024 Generator Cheats Tested On Android Ios (WORKING TIPS)
Keywords:
MovieStarPlanet Generator Cheats 2024 (WORKING IN 5 SECOND) ★★
Author(s):
MovieStarPlanet Generator Cheats 2024 (WORKING IN 5 SECOND)
Keywords:
Raid Shadow Legends Generator Cheats Free 2024 in 5 minutes (New Generator Cheats Raid Shadow Legends) ★★
Author(s):
Raid Shadow Legends Generator Cheats Free 2024 in 5 minutes (New Generator Cheats Raid Shadow Legends)
Keywords:
Chords of longest cycles ★★★
Author(s): Thomassen
Keywords: chord; connectivity; cycle
Do any three longest paths in a connected graph have a vertex in common? ★★
Author(s): Gallai
Keywords:
Chromatic number of $\frac{3}{3}$-power of graph ★★
Author(s):
Let be a graph and . The graph is defined to be the -power of the -subdivision of . In other words, .
Keywords:
3-Edge-Coloring Conjecture ★★★
Author(s): Arthur; Hoffmann-Ostenhof
Keywords: 3-edge coloring; 4-flow; removable edge
r-regular graphs are not uniquely hamiltonian. ★★★
Author(s): Sheehan
Keywords: hamiltonian; regular; uniquely hamiltonian
Partition of Complete Geometric Graph into Plane Trees ★★
Author(s):
Keywords: complete geometric graph, edge colouring
Smooth 4-dimensional Poincare conjecture ★★★★
Author(s): Poincare; Smale; Stallings
Keywords: 4-manifold; poincare; sphere
Book Thickness of Subdivisions ★★
Author(s): Blankenship; Oporowski
Let be a finite undirected simple graph.
A -page book embedding of consists of a linear order of and a (non-proper) -colouring of such that edges with the same colour do not cross with respect to . That is, if for some edges , then and receive distinct colours.
One can think that the vertices are placed along the spine of a book, and the edges are drawn without crossings on the pages of the book.
The book thickness of , denoted by bt is the minimum integer for which there is a -page book embedding of .
Let be the graph obtained by subdividing each edge of exactly once.
Keywords: book embedding; book thickness
Primitive pythagorean n-tuple tree ★★
Author(s):
Keywords:
Jacobian Conjecture ★★★
Author(s): Keller
Keywords: Affine Geometry; Automorphisms; Polynomials
Inscribed Square Problem ★★
Author(s): Toeplitz
Keywords: simple closed curve; square
Complete bipartite subgraphs of perfect graphs ★★
Author(s): Fox
Keywords: perfect graph