( en | de | ru )

 

Disambiguation of "Karonski, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
A review of random graphs.

. J. Graph Theory, 6 (4): 349-389 (1982)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michal Olszewski

Michal Pejko

Michal Novotny

Michal Fic

Michal Vorel

 

Other publications of authors with the same name

A New Upper Bound for the Irregularity Strength of Graphs., , and . SIAM J. Discret. Math., 25 (3): 1319-1321 (2011)A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically., , and . PODC, page 219-228. ACM, (1999)On a solution of a randomized three tracks variant of the Gate Matrix Layout problem., and . Discret. Math., 236 (1-3): 179-189 (2001)Thirty years.... Random Struct. Algorithms, 56 (1): 3-4 (2020)On the Distributed Complexity of Computing Maximal Matchings., , and . SIAM J. Discret. Math., 15 (1): 41-57 (2001)Small Cliques in Random Graphs., , , and . Random Struct. Algorithms, 1 (4): 403-434 (1990)The degree of a typical vertex in generalized random intersection graph models., , and . Discret. Math., 306 (18): 2152-2165 (2006)Distributed O(Delta log(n))-Edge-Coloring Algorithm., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 345-355. Springer, (2001)Random Intersection Graph Process., and . Internet Math., 11 (4-5): 385-402 (2015)A review of random graphs.. J. Graph Theory, 6 (4): 349-389 (1982)