Felix Lazebnik

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

On Pappus configurations in Hall planes.

Felix Lazebnik, Lorinda Leshock

Des. Codes Cryptogr., 2022

A New Family of Algebraically Defined Graphs with Small Automorphism Group.

Felix Lazebnik, Vladislav Taranchuk

Electron. J. Comb., 2022

2019

The maximum number of colorings of graphs of given order and size: A survey.

Felix Lazebnik

Discret. Math., 2019

On the uniqueness of some girth eight algebraically defined graphs, Part II.

Brian G. Kronenthal, Felix Lazebnik, Jason Williford

Discret. Appl. Math., 2019

2018

Spectral and Combinatorial Properties of Some Algebraically Defined Graphs.

Sebastian M. Cioaba, Felix Lazebnik, Shuying Sun

Electron. J. Comb., 2018

2017

A Note on the Isomorphism Problem for Monomial Digraphs.

Aleksandr Kodess, Felix Lazebnik

J. Interconnect. Networks, 2017

Proof of a conjecture on monomial graphs.

Xiang-dong Hou, Stephen D. Lappano, Felix Lazebnik

Finite Fields Their Appl., 2017

2016

On the uniqueness of some girth eight algebraically defined graphs.

Brian G. Kronenthal, Felix Lazebnik

Discret. Appl. Math., 2016

2015

Connectivity of some Algebraically Defined Digraphs.

Aleksandr Kodess, Felix Lazebnik

Electron. J. Comb., 2015

2014

On the spectrum of Wenger graphs.

Sebastian M. Cioaba, Felix Lazebnik, Weiqiang Li

J. Comb. Theory, Ser. B, 2014

2013

Embedding Cycles in Finite Planes.

Felix Lazebnik, Keith E. Mellinger, Oscar Vega

Electron. J. Comb., 2013

2012

On the classification of planar monomials over fields of square order.

Robert S. Coulter, Felix Lazebnik

Finite Fields Their Appl., 2012

2010

An Extremal Property of Turán Graphs.

Felix Lazebnik, Spencer Tofts

Electron. J. Comb., 2010

2008

Irregularity strength of dense graphs.

Bill Cuckler, Felix Lazebnik

J. Graph Theory, 2008

An Extremal Characterization of Projective Planes.

Stefaan De Winter, Felix Lazebnik, Jacques Verstraëte

Electron. J. Comb., 2008

2007

Maximum number of colorings of (2<i>k, k</i>²)-graphs.

Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar

J. Graph Theory, 2007

On monomial graphs of girth eight.

Vasyl Dmytrenko, Felix Lazebnik, Jason Williford

Finite Fields Their Appl., 2007

2005

Isomorphism criterion for monomial graphs.

Vasyl Dmytrenko, Felix Lazebnik, Raymond Viglione

J. Graph Theory, 2005

2004

Orthomorphisms and the construction of projective planes.

Felix Lazebnik, Andrew Thomason

Math. Comput., 2004

On the connectivity of certain graphs of high girth.

Felix Lazebnik, Raymond Viglione

Discret. Math., 2004

2003

On Hypergraphs of Girth Five.

Felix Lazebnik, Jacques Verstraëte

Electron. J. Comb., 2003

2002

An infinite series of regular edge- but not vertex-transitive graphs.

Felix Lazebnik, Raymond Viglione

J. Graph Theory, 2002

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs.

Felix Lazebnik, Dhruv Mubayi

Adv. Appl. Math., 2002

2001

General properties of some families of graphs defined by systems of equations.

Felix Lazebnik, Andrew J. Woldar

J. Graph Theory, 2001

2000

Characterizing Solutions to Simple Differential Equations: 10729.

David P. Bellamy, Felix Lazebnik, Ray Redheffer

Am. Math. Mon., 2000

New Lower Bounds on the Multicolor Ramsey Numbers r_k(C₄).

Felix Lazebnik, Andrew J. Woldar

J. Comb. Theory, Ser. B, 2000

General Properties of Some Graphs Defined by Systems of Equations.

Felix Lazebnik, Andrew J. Woldar

Electron. Notes Discret. Math., 2000

1999

Polarities and 2k-cycle-free graphs.

Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar

Discret. Math., 1999

1997

On the structure of extremal graphs of high girth.

Felix Lazebnik, Ping Wang

J. Graph Theory, 1997

New upper bounds on the order of cages.

Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar

Electron. J. Comb., 1997

1996

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

Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar

Discret. Math., 1996

1995

Graphs of Prescribed Girth and Bi-Degree.

Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar

J. Comb. Theory, Ser. B, 1995

Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size.

Felix Lazebnik, Vasiliy A. Ustimenko

Discret. Appl. Math., 1995

1994

Properties of Certain Families of 2<i>k</i>-Cycle-Free Graphs.

Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar

J. Comb. Theory, Ser. B, 1994

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

Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar

J. Comb. Theory, Ser. B, 1994

On the Number of Nowhere Zero Points in Linear Mappings.

Ronald D. Baker, Joseph E. Bonin, Felix Lazebnik, Eugenii Shustin

Comb., 1994

1993

Extremal graphs without three-cycles or four-cycles.

David K. Garnick, Y. H. Harris Kwong, Felix Lazebnik

J. Graph Theory, 1993

New Examples of Graphs without Small Cycles and of Large Size.

Felix Lazebnik, Vasiliy A. Ustimenko

Eur. J. Comb., 1993

1992

Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size.

Felix Lazebnik, Vasiliy A. Ustimenko

Proceedings of the Expanding Graphs, 1992

1991

Some corollaries of a theorem of Whitney on the chromatic polynomial.

Felix Lazebnik

Discret. Math., 1991

On the number of irregular assignments on a graph.

Gary L. Ebert, Joe Hemmeter, Felix Lazebnik, Andrew J. Woldar

Discret. Math., 1991

1990

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

Felix Lazebnik

J. Graph Theory, 1990

1989

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

Felix Lazebnik

J. Graph Theory, 1989