Felix Lazebnik

According to our database1, Felix Lazebnik authored at least 43 papers between 1989 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On Pappus configurations in Hall planes.
Des. Codes Cryptogr., 2022

A New Family of Algebraically Defined Graphs with Small Automorphism Group.
Electron. J. Comb., 2022

2019
The maximum number of colorings of graphs of given order and size: A survey.
Discret. Math., 2019

On the uniqueness of some girth eight algebraically defined graphs, Part II.
Discret. Appl. Math., 2019

2018
Spectral and Combinatorial Properties of Some Algebraically Defined Graphs.
Electron. J. Comb., 2018

2017
A Note on the Isomorphism Problem for Monomial Digraphs.
J. Interconnect. Networks, 2017

Proof of a conjecture on monomial graphs.
Finite Fields Their Appl., 2017

2016
On the uniqueness of some girth eight algebraically defined graphs.
Discret. Appl. Math., 2016

2015
Connectivity of some Algebraically Defined Digraphs.
Electron. J. Comb., 2015

2014
On the spectrum of Wenger graphs.
J. Comb. Theory B, 2014

2013
Embedding Cycles in Finite Planes.
Electron. J. Comb., 2013

2012
On the classification of planar monomials over fields of square order.
Finite Fields Their Appl., 2012

2010
An Extremal Property of Turán Graphs.
Electron. J. Comb., 2010

2008
Irregularity strength of dense graphs.
J. Graph Theory, 2008

An Extremal Characterization of Projective Planes.
Electron. J. Comb., 2008

2007
Maximum number of colorings of (2<i>k, k</i><sup>2</sup>)-graphs.
J. Graph Theory, 2007

On monomial graphs of girth eight.
Finite Fields Their Appl., 2007

2005
Isomorphism criterion for monomial graphs.
J. Graph Theory, 2005

2004
Orthomorphisms and the construction of projective planes.
Math. Comput., 2004

On the connectivity of certain graphs of high girth.
Discret. Math., 2004

2003
On Hypergraphs of Girth Five.
Electron. J. Comb., 2003

2002
An infinite series of regular edge- but not vertex-transitive graphs.
J. Graph Theory, 2002

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs.
Adv. Appl. Math., 2002

2001
General properties of some families of graphs defined by systems of equations.
J. Graph Theory, 2001

2000
Characterizing Solutions to Simple Differential Equations: 10729.
Am. Math. Mon., 2000

New Lower Bounds on the Multicolor Ramsey Numbers r<sub>k</sub>(C<sub>4</sub>).
J. Comb. Theory B, 2000

General Properties of Some Graphs Defined by Systems of Equations.
Electron. Notes Discret. Math., 2000

1999
Polarities and 2k-cycle-free graphs.
Discret. Math., 1999

1997
On the structure of extremal graphs of high girth.
J. Graph Theory, 1997

New upper bounds on the order of cages.
Electron. J. Comb., 1997

1996
A characterization of the components of the graphs D(k, q).
Discret. Math., 1996

1995
Graphs of Prescribed Girth and Bi-Degree.
J. Comb. Theory B, 1995

Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size.
Discret. Appl. Math., 1995

1994
Properties of Certain Families of 2<i>k</i>-Cycle-Free Graphs.
J. Comb. Theory B, 1994

New Constructions of Bipartite Graphs on <i>m</i>, <i>n</i> Vertices with Many Edges and Without Small Cycles.
J. Comb. Theory B, 1994

On the Number of Nowhere Zero Points in Linear Mappings.
Comb., 1994

1993
Extremal graphs without three-cycles or four-cycles.
J. Graph Theory, 1993

New Examples of Graphs without Small Cycles and of Large Size.
Eur. J. Comb., 1993

1992
Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size.
Proceedings of the Expanding Graphs, 1992

1991
Some corollaries of a theorem of Whitney on the chromatic polynomial.
Discret. Math., 1991

On the number of irregular assignments on a graph.
Discret. Math., 1991

1990
New upper bounds for the greatest number of proper colorings of a (<i>V</i>, <i>E</i>)-graph.
J. Graph Theory, 1990

1989
On the greatest number of 2 and 3 colorings of a (v, e)-graph.
J. Graph Theory, 1989


  Loading...