default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelix Lazebnik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j42]Felix Lazebnik, Vladislav Taranchuk:
A New Family of Algebraically Defined Graphs with Small Automorphism Group. Electron. J. Comb. 29(1) (2022)- [j41]Felix Lazebnik, Lorinda Leshock:
On Pappus configurations in Hall planes. Des. Codes Cryptogr. 90(5): 1203-1219 (2022)
2010 – 2019
- 2019
- [j40]Brian G. Kronenthal
, Felix Lazebnik, Jason Williford:
On the uniqueness of some girth eight algebraically defined graphs, Part II. Discret. Appl. Math. 254: 161-170 (2019) - [j39]Felix Lazebnik:
The maximum number of colorings of graphs of given order and size: A survey. Discret. Math. 342(10): 2783-2791 (2019) - 2018
- [j38]Sebastian M. Cioaba, Felix Lazebnik, Shuying Sun:
Spectral and Combinatorial Properties of Some Algebraically Defined Graphs. Electron. J. Comb. 25(4): 4 (2018) - 2017
- [j37]Xiang-dong Hou, Stephen D. Lappano, Felix Lazebnik:
Proof of a conjecture on monomial graphs. Finite Fields Their Appl. 43: 42-68 (2017) - [j36]Aleksandr Kodess, Felix Lazebnik:
A Note on the Isomorphism Problem for Monomial Digraphs. J. Interconnect. Networks 17(3-4): 1741006:1-1741006:12 (2017) - [i2]Sebastian M. Cioaba, Felix Lazebnik, Shuying Sun:
Spectral and Combinatorial Properties of Some Algebraically Defined Graphs. CoRR abs/1708.07597 (2017) - 2016
- [j35]Brian G. Kronenthal, Felix Lazebnik:
On the uniqueness of some girth eight algebraically defined graphs. Discret. Appl. Math. 206: 188-194 (2016) - 2015
- [j34]Aleksandr Kodess, Felix Lazebnik:
Connectivity of some Algebraically Defined Digraphs. Electron. J. Comb. 22(3): 3 (2015) - 2014
- [j33]Sebastian M. Cioaba, Felix Lazebnik, Weiqiang Li:
On the spectrum of Wenger graphs. J. Comb. Theory B 107: 132-139 (2014) - [i1]Sebastian M. Cioaba, Felix Lazebnik, Weiqiang Li:
On the Spectrum of Wenger Graphs. CoRR abs/1402.3341 (2014) - 2013
- [j32]Felix Lazebnik, Keith E. Mellinger, Oscar Vega:
Embedding Cycles in Finite Planes. Electron. J. Comb. 20(3): 24 (2013) - 2012
- [j31]Robert S. Coulter, Felix Lazebnik:
On the classification of planar monomials over fields of square order. Finite Fields Their Appl. 18(2): 316-336 (2012) - 2010
- [j30]Felix Lazebnik, Spencer Tofts:
An Extremal Property of Turán Graphs. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2008
- [j29]Stefaan De Winter, Felix Lazebnik, Jacques Verstraëte:
An Extremal Characterization of Projective Planes. Electron. J. Comb. 15(1) (2008) - [j28]Bill Cuckler, Felix Lazebnik:
Irregularity strength of dense graphs. J. Graph Theory 58(4): 299-313 (2008) - 2007
- [j27]Vasyl Dmytrenko, Felix Lazebnik, Jason Williford:
On monomial graphs of girth eight. Finite Fields Their Appl. 13(4): 828-842 (2007) - [j26]Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar:
Maximum number of colorings of (2k, k2)-graphs. J. Graph Theory 56(2): 135-148 (2007) - 2005
- [j25]Vasyl Dmytrenko, Felix Lazebnik, Raymond Viglione:
Isomorphism criterion for monomial graphs. J. Graph Theory 48(4): 322-328 (2005) - 2004
- [j24]Felix Lazebnik, Raymond Viglione:
On the connectivity of certain graphs of high girth. Discret. Math. 277(1-3): 309-319 (2004) - [j23]Felix Lazebnik, Andrew Thomason:
Orthomorphisms and the construction of projective planes. Math. Comput. 73(247): 1547-1557 (2004) - 2003
- [j22]Felix Lazebnik, Jacques Verstraëte:
On Hypergraphs of Girth Five. Electron. J. Comb. 10 (2003) - 2002
- [j21]Felix Lazebnik, Dhruv Mubayi:
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs. Adv. Appl. Math. 28(3-4): 544-559 (2002) - [j20]Felix Lazebnik, Raymond Viglione:
An infinite series of regular edge- but not vertex-transitive graphs. J. Graph Theory 41(4): 249-258 (2002) - 2001
- [j19]Felix Lazebnik, Andrew J. Woldar:
General properties of some families of graphs defined by systems of equations. J. Graph Theory 38(2): 65-86 (2001) - 2000
- [j18]Felix Lazebnik, Andrew J. Woldar:
General Properties of Some Graphs Defined by Systems of Equations. Electron. Notes Discret. Math. 5: 206-209 (2000) - [j17]Felix Lazebnik, Andrew J. Woldar:
New Lower Bounds on the Multicolor Ramsey Numbers rk(C4). J. Comb. Theory B 79(2): 172-176 (2000) - [j16]David P. Bellamy, Felix Lazebnik, Ray Redheffer:
Characterizing Solutions to Simple Differential Equations: 10729. Am. Math. Mon. 107(4): 377 (2000)
1990 – 1999
- 1999
- [j15]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
Polarities and 2k-cycle-free graphs. Discret. Math. 197-198: 503-513 (1999) - 1997
- [j14]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New upper bounds on the order of cages. Electron. J. Comb. 4(2) (1997) - [j13]Felix Lazebnik, Ping Wang:
On the structure of extremal graphs of high girth. J. Graph Theory 26(3): 147-153 (1997) - 1996
- [j12]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
A characterization of the components of the graphs D(k, q). Discret. Math. 157(1-3): 271-283 (1996) - 1995
- [j11]Felix Lazebnik, Vasiliy A. Ustimenko:
Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size. Discret. Appl. Math. 60(1-3): 275-284 (1995) - [j10]Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar:
Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory B 64(2): 228-239 (1995) - 1994
- [j9]Ronald D. Baker, Joseph E. Bonin, Felix Lazebnik, Eugenii Shustin:
On the Number of Nowhere Zero Points in Linear Mappings. Comb. 14(2): 149-157 (1994) - [j8]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
Properties of Certain Families of 2k-Cycle-Free Graphs. J. Comb. Theory B 60(2): 293-298 (1994) - [j7]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles. J. Comb. Theory B 61(1): 111-117 (1994) - 1993
- [j6]Felix Lazebnik, Vasiliy A. Ustimenko:
New Examples of Graphs without Small Cycles and of Large Size. Eur. J. Comb. 14(5): 445-460 (1993) - [j5]David K. Garnick, Y. H. Harris Kwong, Felix Lazebnik:
Extremal graphs without three-cycles or four-cycles. J. Graph Theory 17(5): 633-645 (1993) - 1992
- [c1]Felix Lazebnik, Vasiliy A. Ustimenko:
Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size. Expanding Graphs 1992: 75-93 - 1991
- [j4]Felix Lazebnik:
Some corollaries of a theorem of Whitney on the chromatic polynomial. Discret. Math. 87(1): 53-64 (1991) - [j3]Gary L. Ebert, Joe Hemmeter, Felix Lazebnik, Andrew J. Woldar:
On the number of irregular assignments on a graph. Discret. Math. 93(2-3): 131-142 (1991) - 1990
- [j2]Felix Lazebnik:
New upper bounds for the greatest number of proper colorings of a (V, E)-graph. J. Graph Theory 14(1): 25-29 (1990)
1980 – 1989
- 1989
- [j1]Felix Lazebnik:
On the greatest number of 2 and 3 colorings of a (v, e)-graph. J. Graph Theory 13(2): 203-214 (1989)
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 20:26 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:
