default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerge Lawrencenko
Person information
- unicode name: С. А. Лавренченко
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]Serge Lawrencenko
, Abdulkarim M. Magomedov:
Generating the Triangulations of the Torus with the Vertex-Labeled Complete 4-Partite Graph K2, 2, 2, 2. Symmetry 13(8): 1418 (2021)
2010 – 2019
- 2019
- [j15]Wenzhong Liu, Serge Lawrencenko, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye, Xiaoya Zha:
Quadrangular embeddings of complete graphs and the Even Map Color Theorem. J. Comb. Theory B 139: 1-26 (2019) - 2017
- [j14]Serge Lawrencenko, Mikhail N. Vyalyi, L. V. Zgonnik:
Grünbaum coloring and its generalization to arbitrary dimension. Australas. J Comb. 67: 119-130 (2017) - 2016
- [i3]Serge Lawrencenko, Mikhail N. Vyalyi, L. V. Zgonnik:
Grünbaum coloring and its generalization to arbitrary dimension. CoRR abs/1607.03959 (2016) - 2015
- [i2]Serge Lawrencenko, Irina A. Duborkina:
Search algorithms for efficient logistics chains. CoRR abs/1504.03170 (2015) - 2012
- [i1]Serge Lawrencenko:
On the minimum order of a quadrangulation on a given closed 2-manifold. CoRR abs/1208.5207 (2012) - 2010
- [j13]Serge Lawrencenko:
Polyhedral Suspensions of Arbitrary Genus. Graphs Comb. 26(4): 537-548 (2010)
2000 – 2009
- 2002
- [j12]Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
Isoperimetric Constants of Infinite Plane Graphs. Discret. Comput. Geom. 28(3): 313-330 (2002) - 2001
- [j11]Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
Bounds for isoperimetric constants of infinite plane graphs. Discret. Appl. Math. 113(2-3): 237-241 (2001) - 2000
- [j10]Beifang Chen, Jin Ho Kwak, Serge Lawrencenko:
Weinberg bounds over nonspherical graphs. J. Graph Theory 33(4): 220-236 (2000)
1990 – 1999
- 1999
- [j9]Serge Lawrencenko, Seiya Negami:
Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle. J. Comb. Theory B 77(1): 211-218 (1999) - 1998
- [j8]Beifang Chen, Serge Lawrencenko:
Structural characterization of projective flexibility. Discret. Math. 188(1-3): 233-238 (1998) - 1997
- [j7]Serge Lawrencenko, Jingzhong Mao:
A Sharp Lower Bound for the Number of Connectivity-Redundant Nodes. Ars Comb. 47 (1997) - [j6]Serge Lawrencenko, Seiya Negami:
Irreducible Triangulations of the Klein Bottle. J. Comb. Theory B 70(2): 265-291 (1997) - [j5]Serge Lawrencenko, Qiang Luo:
Graphs with given connectivity properties. Networks 30(4): 255-261 (1997) - 1994
- [j4]Serge Lawrencenko, Seiya Negami, Arthur T. White:
Three nonisomorphic triangulations of an orientable surface with the same complete graph. Discret. Math. 135(1-3): 367-369 (1994) - 1993
- [j3]Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik:
Realizing the chromatic numbers of triangulations of surfaces. Discret. Math. 122(1-3): 197-204 (1993) - 1992
- [j2]Serge Lawrencenko:
The variety of triangular embeddings of a graph in the projective plane. J. Comb. Theory B 54(2): 196-208 (1992)
1980 – 1989
- 1987
- [j1]Serge Lavrenchenko:
An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus. Discret. Math. 66(3): 299-301 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
