PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "McDiarmid, Colin"

Author of the publication

copydeleteadd this publication to your clipboard
The Strongly Connected Components of 1-in, 1-out.

, and . Combinatorics, Probability & Computing, (1992)

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.

Colin Reiff University of Stuttgart

Colin Sauerzapf University of Stuttgart

 

Other publications of authors with the same name

Connectivity for Random Graphs from a Weighted Bridge-Addable Class.. Electr. J. Comb., 19 (4): P53 (2012)Channel assignment on graphs of bounded treewidth., and . Discrete Mathematics, 273 (1-3): 183-192 (2003)Recognition of unipolar and generalised split graphs., and . CoRR, (2016)Random perfect graphs., and . Random Struct. Algorithms, 54 (1): 148-186 (2019)Acyclic Coloring of Graphs., , and . Random Struct. Algorithms, 2 (3): 277-288 (1991)Average Case Analysis of Heap Building by Repeated Insertion., and . J. Algorithms, 12 (1): 126-153 (1991)The Strongly Connected Components of 1-in, 1-out., and . Combinatorics, Probability & Computing, (1992)Almost Every Graph can be Covered by fracDelta2 Linear Forests., and . Combinatorics, Probability & Computing, (1995)The t-Improper Chromatic Number of Random Graphs., and . Combinatorics, Probability & Computing, 19 (1): 87-98 (2010)On the Maximum Degree of a Random Planar Graph., and . Combinatorics, Probability & Computing, 17 (4): 591-601 (2008)