Brendan D. McKay

Tamás Makai

Comb. Probab. Comput., March, 2023

Factorisation of the complete graph into spanning regular factors.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2023

2022

Fast fully dynamic labelling for distance queries.

[BibT_eX]

[DOI]

VLDB J., 2022

The minimality of the Georges-Kelmans graph.

[BibT_eX]

[DOI]

Math. Comput., 2022

Surge: a fast open-source chemical graph generator.

[BibT_eX]

[DOI]

Mehmet Aziz Yirik

Christoph Steinbeck

J. Cheminformatics, 2022

Asymptotic enumeration of non-uniform linear hypergraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

2021

Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs.

[BibT_eX]

[DOI]

Exp. Math., 2021

Subgraph counts for dense random graphs with specified degrees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence.

[BibT_eX]

[DOI]

Tejas Iyer

Electron. J. Comb., 2020

Asymptotic enumeration of linear hypergraphs with given number of vertices and edges.

[BibT_eX]

[DOI]

Fang Tian

Adv. Appl. Math., 2020

Sandwiching random regular graphs between binomial random graphs.

[BibT_eX]

[DOI]

Pu Gao

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Iteration Number of Colour Refinement.

[BibT_eX]

[DOI]

Sandra Kiefer

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

The r-switching-stable graphs.

[BibT_eX]

[DOI]

Jeanette C. McLeod

Beáta Faller

Discret. Appl. Math., 2019

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2019

2018

Complex martingales and asymptotic enumeration.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

R(5, 5) ≤ 48

[BibT_eX]

[DOI]

Vigleik Angeltveit

J. Graph Theory, 2018

Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Hypohamiltonian Planar Cubic Graphs with Girth 5.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Planar Hypohamiltonian Graphs on 40 Vertices.

[BibT_eX]

[DOI]

Mohammadreza Jooyandeh

Patric R. J. Östergård

Ville H. Pettersson

Carol T. Zamfirescu

J. Graph Theory, 2017

The average number of spanning trees in sparse graphs with given degrees.

[BibT_eX]

[DOI]

Matthew Kwan

Eur. J. Comb., 2017

On Ryser's conjecture for linear intersecting multipartite hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

2016

Graph Isomorphism.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Bipartite edge partitions and the former Alon-Saks-Seymour conjecture.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

2015

A Faster Test for 4-Flow-Criticality in Snarks.

[BibT_eX]

[DOI]

André Breda Carneiro

Cândida Nunes da Silva

Electron. Notes Discret. Math., 2015

Fullerenes with distant pentagons.

[BibT_eX]

[DOI]

CoRR, 2015

Recursive generation of IPR fullerenes.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Competition Numbers, Quasi-line Graphs, and Holes.

[BibT_eX]

[DOI]

Pascal Schweitzer

Patrick Schweitzer

SIAM J. Discret. Math., 2014

Practical graph isomorphism, II.

[BibT_eX]

[DOI]

Adolfo Piperno

J. Symb. Comput., 2014

Switching Reconstruction of Digraphs.

[BibT_eX]

[DOI]

Pascal Schweitzer

J. Graph Theory, 2014

2013

Asymptotic Enumeration of Sparse Multigraphs with Given Degrees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A Note on the History of the Four-Colour Conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

3-Perfect hamiltonian decomposition of the complete graph.

[BibT_eX]

[DOI]

Australas. J Comb., 2013

2012

The Generation of Fullerenes.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2012

2011

Recursive generation of simple planar 5-regular graphs and pentangulations.

[BibT_eX]

[DOI]

Tristan Reeves

J. Graph Algorithms Appl., 2011

Computational determination of (3, 11) and (4, 7) cages.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Generation of Cubic graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2011

Subgraphs of Dense Random Graphs with Specified Degrees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

2010

Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

Rectangular-radial drawings of cubic plane graphs.

[BibT_eX]

[DOI]

S. Mehdi Hashemi

Maryam Tahmasbi

Comput. Geom., 2010

Asymptotic enumeration of integer matrices with large equal row and column sums.

[BibT_eX]

[DOI]

Comb., 2010

Asymptotic enumeration of correlation-immune boolean functions.

[BibT_eX]

[DOI]

Zhicheng Gao

Robert W. Robinson

Cryptogr. Commun., 2010

2009

Random dense bipartite graphs and directed graphs with specified degrees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Graph structural properties of non-Yutsis graphs allowing fast recognition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Subgraphs of Random k-Edge-Coloured k-Regular Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Recursive Generation of 5-Regular Planar Graphs.

[BibT_eX]

[DOI]

Tristan Reeves

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Spherical-Rectangular Drawings.

[BibT_eX]

[DOI]

S. Mehdi Hashemi

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Census of Small Latin Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Asymptotic enumeration of dense 0-1 matrices with specified line sums.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2008

Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2008

2007

A generalized switching method for combinatorial estimation.

[BibT_eX]

[DOI]

Veerle Fack

Australas. J Comb., 2007

Computing Symmetries of Combinatorial Objects.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.

[BibT_eX]

[DOI]

Xiaoji Wang

J. Comb. Theory A, 2006

A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs.

[BibT_eX]

[DOI]

Seok-Hee Hong

Peter Eades

Discret. Comput. Geom., 2006

The number of transversals in a Latin square.

[BibT_eX]

[DOI]

Jeanette C. McLeod

Des. Codes Cryptogr., 2006

2005

Construction of planar triangulations with minimum degree 5.

[BibT_eX]

[DOI]

Discret. Math., 2005

Generation of simple quadrangulations of the sphere.

[BibT_eX]

[DOI]

Sam Greenberg

Robin Thomas

Paul Wollan

Discret. Math., 2005

To be or not to be Yutsis: Algorithms for the decision problem.

[BibT_eX]

[DOI]

Comput. Phys. Commun., 2005

Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

2004

Short Cycles in Random Regular Graphs.

[BibT_eX]

[DOI]

Beata Wysocka

Electron. J. Comb., 2004

Ramsey Numbers for Triangles versus Almost-Complete Graphs.

[BibT_eX]

Konrad Piwakowski

Ars Comb., 2004

2003

The asymptotic number of claw-free cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Posets on up to 16 Points.

[BibT_eX]

[DOI]

Order, 2002

The Distributions of the Entries of Young Tableaux.

[BibT_eX]

[DOI]

Jennifer Morse

Herbert S. Wilf

J. Comb. Theory A, 2002

Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Symmetric drawings of triconnected planar graphs.

[BibT_eX]

[DOI]

Seok-Hee Hong

Peter Eades

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Classification of regular two-graphs on 36 and 38 vertices.

[BibT_eX]

[DOI]

Edward Spence

Australas. J Comb., 2001

2000

Nonhamiltonian 3-Connected Cubic Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.

[BibT_eX]

[DOI]

Zhicheng Gao

Xiaoji Wang

Random Struct. Algorithms, 2000

The asymptotic number of graphs with a restriction on the maximum degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

TrExML: a maximum-likelihood approach for extensive tree-space exploration.

[BibT_eX]

[DOI]

Bioinform., 2000

1999

Most Latin Squares Have Many Subsquares.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1999

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1999

Fast generation of some classes of planar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation.

[BibT_eX]

[DOI]

Weifa Liang

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1998

A Note on Large Graphs of Diameter Two and Given Maximum Degree, .

[BibT_eX]

[DOI]

Mirka Miller

Jozef Sirán

J. Comb. Theory B, 1998

Isomorph-Free Exhaustive Generation.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.

[BibT_eX]

[DOI]

Robert W. Robinson

Comb. Probab. Comput., 1998

Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

Collective Choice and Mutual Knowledge Structures.

[BibT_eX]

[DOI]

Diana Richards

Whitman Richards

Adv. Complex Syst., 1998

Fast Backtracking Principles Applied to Find New Cages.

[BibT_eX]

[DOI]

Wendy J. Myrvold

Jacqueline Nadon

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

The degree sequence of a random graph. I. The models.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

Subgraph Counting Identities and Ramsey Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Small graphs are reconstructible.

[BibT_eX]

[DOI]

Australas. J Comb., 1997

1996

Vertex-transitive graphs that are not Cayley graphs. II.

[BibT_eX]

[DOI]

Cheryl E. Praeger

J. Graph Theory, 1996

Asymptotic Enumeration of Tournaments with a Given Score Sequence.

[BibT_eX]

[DOI]

Xiaoji Wang

J. Comb. Theory A, 1996

NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems.

[BibT_eX]

[DOI]

Weifa Liang

Hong Shen

Inf. Process. Lett., 1996

1995

R(4, 5) = 25.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

The Smallest Cubic Graphs of Girth Nine.

[BibT_eX]

[DOI]

Carsten Saager

Comb. Probab. Comput., 1995

Latin Squares of Order 10.

[BibT_eX]

[DOI]

Eric Rogoyski

Electron. J. Comb., 1995

1994

Multicolored Trees in Random Graphs.

[BibT_eX]

[DOI]

Alan M. Frieze

Random Struct. Algorithms, 1994

Linear Programming in Some Ramsey Problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

1992

Asymptotic Properties of Labeled Connected Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

The value of the Ramsey number r(3, 8).

[BibT_eX]

[DOI]

Zhang Ke Min

J. Graph Theory, 1992

On Subgraph Sizes in Random Graphs.

[BibT_eX]

[DOI]

Neil J. Calkin

Alan M. Frieze

Comb. Probab. Comput., 1992

A new upper bound on the Ramsey number R(5, 5).

[BibT_eX]

[DOI]

Australas. J Comb., 1992

The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges.

[BibT_eX]

[DOI]

Australas. J Comb., 1992

1991

Ralph Gordon Stanton.

[BibT_eX]

Jennifer Seberry

Scott A. Vanstone

Discret. Math., 1991

Asymptotic enumeration by degree sequence of graphs with degress o(n1/2).

[BibT_eX]

[DOI]

Comb., 1991

The First Classical Ramsey Number for Hypergraphs is Computed.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Asymptotic enumeration of Latin rectangles.

[BibT_eX]

[DOI]

Chris D. Godsil

J. Comb. Theory B, 1990

Uniform Generation of Random Regular Graphs of Moderate Degree.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 1990

The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs.

[BibT_eX]

[DOI]

Comb., 1990

1988

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.

[BibT_eX]

[DOI]

Derek A. Holton

J. Comb. Theory B, 1988

1987

Determinants and ranks of random matrices over Zm.

[BibT_eX]

[DOI]

Richard P. Brent

Discret. Math., 1987

1986

Constant Time Generation of Free Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

The number of matchings in random regular graphs and bipartite graphs.

[BibT_eX]

[DOI]

Béla Bollobás

J. Comb. Theory B, 1986

1985

Hamiltonian cycles in cubic 3-connected bipartite planar graphs.

[BibT_eX]

[DOI]

Derek A. Holton

Bennet Manvel

J. Comb. Theory B, 1985

Integer sequences with proscribed differences and bounded growth rate.

[BibT_eX]

[DOI]

Robert L. Hemminger

Discret. Math., 1985

1984

An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property.

[BibT_eX]

[DOI]

Peter Eades

Inf. Process. Lett., 1984

Automorphisms of random graphs with specified vertices.

[BibT_eX]

[DOI]

Comb., 1984

1983

Spanning Trees in Regular Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

1982

A nine point theorem for 3-connected graphs.

[BibT_eX]

[DOI]

Comb., 1982

1981

Spectral conditions for the reconstructibility of a graph.

[BibT_eX]

[DOI]

Chris D. Godsil

J. Comb. Theory B, 1981

1980

A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.

[BibT_eX]

[DOI]

Charles J. Colbourn

Inf. Process. Lett., 1980

1979

Hadamard equivalence via graph isomorphism.

[BibT_eX]

[DOI]

Discret. Math., 1979

1977

Computer reconstruction of small graphs.

[BibT_eX]

[DOI]