Grinberg's theorem

Known as: Grinberg, Grinberg theorem 
In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengths of its face… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • CONFLUENTES MATHEMATICI, David BOURQUI, J Sebag, DAVID BOURQUI
  • 2017
Let k be a field. In this article, we provide an extended version of the Drinfeld-Grinberg-Kazhdan Theorem in the context of… (More)
Is this relevant?
Highly Cited
2015
Highly Cited
2015
A processing-in-memory architecture for exascale systems R. Nair S. F. Antao C. Bertolli P. Bose J. R. Brunheroto T. Chen C.-Y… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2015
Review
2015
We compared the standard 2D representation of a recent violent computer game to its 3D representation realized by shutter-goggles… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
Robertson ([3]) and independently, Bondy ([1]) proved that the generalized Petersen graph P(n,2) is non-hamiltonian if n == 5… (More)
Is this relevant?
2005
2005
J. Bacteriol. 166, 1128 (1986) 2. Rohde, M., Mayer, E, Hicks, D.B., Krulwich, T.A.: Biochim. Biophys. Acta 985, 233 (1989) 3… (More)
  • figure 1
Is this relevant?
2004
2004
The organizat ion of manufac tu re of akrikhin, an an t ima la r i a l drug m o r e act ive therapeut ica l ly and prophylac t… (More)
Is this relevant?
2002
2002
  • Vladimir Drinfeld
  • 2002
Let X be a scheme of finite type over a field k, and X • ⊂ X the smooth part of X. Consider the scheme L(X) of formal arcs in X… (More)
Is this relevant?
1982
1982
Grinberg’s Theorem ([3], see also [ 1,2,4,5]) is well known; it asserts that if a planar graph G is Hamiltonian, then the numbers… (More)
Is this relevant?
1978
1978
As in [6], we define a planar map as a dissection of a sphere into a finite number of simply connected regions, called faces, by… (More)
  • figure 1
  • figure 3
Is this relevant?
1975
1975
The notion of a commonsense algorithm is presented as a basic data structure for modeling human cognition. This data structure… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?