Stefanie Gerke

Gregory Z. Gutin

J. Graph Theory, 2022

Extended path partition conjecture for semicomplete and acyclic compositions.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Proximity and remoteness in directed and undirected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Successive shortest paths in complete graphs with random edge weights.

[BibT_eX]

[DOI]

Balázs F. Mezei

Gregory B. Sorkin

Random Struct. Algorithms, 2020

Proper orientation number of triangle-free bridgeless outerplanar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Note on 4-Kings in Bipartite Hypertournaments.

[BibT_eX]

[DOI]

Jiangdong Ai

Gregory Z. Gutin

CoRR, 2020

2019

The asymptotic number of prefix normal words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2015

Maximizing the Minimum Load for Random Processing Times.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Justus Schwartz

ACM Trans. Algorithms, 2015

Nonvertex-Balanced Factors in Random Graphs.

[BibT_eX]

[DOI]

Andrew McDowell

J. Graph Theory, 2015

Controllability and matchings in random bipartite graphs.

[BibT_eX]

[DOI]

Paul N. Balister

Proceedings of the Surveys in Combinatorics 2015, 2015

2011

Pegging Graphs Yields a Small Diameter.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Comb. Probab. Comput., 2011

No Dense Subgraphs Appear in the Triangle-free Graph Process.

[BibT_eX]

[DOI]

Tamás Makai

Electron. J. Comb., 2011

2009

Convex Sets in Acyclic Digraphs.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Order, 2009

Algorithms for generating convex sets in acyclic digraphs.

[BibT_eX]

[DOI]

Arezou Soleimanfallah

Anders Yeo

J. Discrete Algorithms, 2009

Connectivity of the uniform random intersection graph.

[BibT_eX]

[DOI]

Simon R. Blackburn

Discret. Math., 2009

2008

Sequences with Changing Dependencies.

[BibT_eX]

[DOI]

Béla Bollobás

SIAM J. Discret. Math., 2008

The random planar graph process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Connectivity of addable graph classes.

[BibT_eX]

[DOI]

Béla Bollobás

J. Comb. Theory B, 2008

The Number of Graphs Not Containing K3, 3 as a Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

A probabilistic counting lemma for complete graphs.

[BibT_eX]

[DOI]

Martin Marciniszyn

Random Struct. Algorithms, 2007

The generalized Randic index of trees.

[BibT_eX]

[DOI]

Paul N. Balister

Béla Bollobás

J. Graph Theory, 2007

Small subsets inherit sparse epsilon-regularity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Generalised acyclic edge colourings of graphs with large girth.

[BibT_eX]

[DOI]

Melanie Raemy

Discret. Math., 2007

A Characterization for Sparse epsilon-Regular Pairs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

K 4-free subgraphs of random graphs revisited.

[BibT_eX]

[DOI]

Comb., 2007

2006

The generalized acyclic edge chromatic number of random regular graphs.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Nicholas C. Wormald

J. Graph Theory, 2006

2005

Random planar graphs with n nodes and a fixed number of edges.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The sparse regularity lemma and its applications.

[BibT_eX]

Proceedings of the Surveys in Combinatorics, 2005

2004

Graph Imperfection with a Co-Site Constraint.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

K5-free subgraphs of random graphs.

[BibT_eX]

[DOI]

Thomas Schickinger

Random Struct. Algorithms, 2004

On the Number of Edges in Random Planar Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

2001

Graph Imperfection II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Graph Imperfection.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Channel Assignment with Large Demands.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2001

2000

Colouring weighted bipartite graphs with a co-site constraint.

[BibT_eX]

[DOI]