Andrew J. Woldar

According to our database, Andrew J. Woldar authored at least 22 papers between 1989 and 2017.

Collaborative distances:

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

2017

A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes.

Vasyl Ustimenko, Andrew J. Woldar

Australas. J Comb., 2017

2010

Examples of computer experimentation in algebraic combinatorics.

Mikhail H. Klin, Christian Pech, Sven Reichard, Andrew J. Woldar, Matan Ziv-Av

Ars Math. Contemp., 2010

2009

Siamese Combinatorial Objects via Computer Algebra Experimentation.

Mikhail H. Klin, Sven Reichard, Andrew J. Woldar

Proceedings of the Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009

2007

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

Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar

J. Graph Theory, 2007

Association schemes on 28 points as mergings of a half-homogeneous coherent configuration.

Mikhail H. Klin, Mikhail E. Muzychuk, Christian Pech, Andrew J. Woldar, Paul-Hermann Zieschang

Eur. J. Comb., 2007

2003

Extremal properties of regular and affine generalized m-gons as tactical configurations.

Vasiliy A. Ustimenko, Andrew J. Woldar

Eur. J. Comb., 2003

2001

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

Felix Lazebnik, Andrew J. Woldar

J. Graph Theory, 2001

2000

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

Felix Lazebnik, Andrew J. Woldar

J. Comb. Theory B, 2000

General Properties of Some Graphs Defined by Systems of Equations.

Felix Lazebnik, Andrew J. Woldar

Electron. Notes Discret. Math., 2000

1999

The Complete List of Maximal Cliques of Quad(n, q), q Even.

Joe Hemmeter, Andrew J. Woldar

Eur. J. Comb., 1999

Polarities and 2k-cycle-free graphs.

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

Discret. Math., 1999

1998

Orbital Schemes of B₃(q) Acting on 2-Dimensional Totally Isotropic Subspaces.

Joe Hemmeter, Vasya J. Ustimenko, Andrew J. Woldar

Eur. J. Comb., 1998

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 B, 1995

The complete list of maximal cliques of Quad(n, q), q odd.

Andries E. Brouwer, Joe Hemmeter, Andrew J. Woldar

Eur. J. Comb., 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 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 B, 1994

1991

On the number of irregular assignments on a graph.

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

Discret. Math., 1991

1990

Classification of the Maximal Cliques of Size ⩾q + 4 m the Quadratic Forms Graph in Odd Characteristic.

Joe Hemmeter, Andrew J. Woldar

Eur. J. Comb., 1990

On the Maximal Cliques of the Quadratic Forms Graph in Even Characteristic.

Joe Hemmeter, Andrew J. Woldar

Eur. J. Comb., 1990

1989

A combinatorial approach to the character theory of split metabelian groups.

Andrew J. Woldar

J. Comb. Theory A, 1989