Search citation statements

Order By: Relevance
Select...
2
1
1
1
0
11
0

Year Published

1991
1991
2015
2015

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

0
11
0
Order By: Relevance
“…For every graph G in G, there is a sequence G 0 , G 1 , ..., G t of members of G such that G 0 is the tetrahedron, G t is G, and each G i+1 is obtained from G i by adding a handle. In [1,2,4,12], analogous results are obtained for 3-regular simple planar graphs with other connectivities. For 4-regular simple planar graphs, the situation is similar and the readers are referred to [3,9,10].…”
Section: Introductionmentioning
Create an account to read the remaining citation statements from this report. You will also get access to:
  • Search over 1.2b+ citation statments to see what is being said about any topic in the research literature
  • Advanced Search to find publications that support or contrast your research
  • Citation reports and visualizations to easily see what publications are saying about each other
  • Browser extension to see Smart Citations wherever you read research
  • Dashboards to evaluate and keep track of groups of publications
  • Alerts to stay on top of citations as they happen
  • Automated reference checks to make sure you are citing reliable research in your manuscripts
  • 7 day free preview of our premium features.

Trusted by researchers and organizations around the world

Over 130,000 students researchers, and industry experts at use scite

See what students are saying

rupbmjkragerfmgwileyiopcupepmcmbcthiemesagefrontiersapsiucrarxivemeralduhksmucshluniversity-of-gavle
“…For every graph G in G, there is a sequence G 0 , G 1 , ..., G t of members of G such that G 0 is the tetrahedron, G t is G, and each G i+1 is obtained from G i by adding a handle. In [1,2,4,12], analogous results are obtained for 3-regular simple planar graphs with other connectivities. For 4-regular simple planar graphs, the situation is similar and the readers are referred to [3,9,10].…”
Section: Introductionmentioning
“…Since v 4 is in the exterior of Δ 1 and v 3 is in the exterior of Δ 2 , the convex hull ch(v 1 4 ) in counterclockwise order. By Lemma 4, T 1 (resp., T 2 ) has a flippable edge e 1 (resp., e 2 ) in a triangle opposite to s. If flipping edge e 1 in T 1 or edge e 2 in T 2 increases the degree of s to 5, then perform the edge flip.…”
Section: Lemma 3 [18] Let G = (S E) Be a Maximal Biplane Graph Inmentioning
“…We have now generated all C5CPs on up Downloaded 05/11/18 to 34.218.44.141. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php to 52 vertices using the generation procedure of Barnette [1] and Butler [6]. The graphs were then checked for hamiltonian cycles.…”
Section: Theorem 2 If G Is a Nonhamiltonian C4cp Of Smallest Order Amentioning