Michael S. O. Molloy

Available identifiers

zbMath Open molloy.michael-s-oWikidataQ102196166 ScholiaQ102196166MaRDI QIDQ215097

List of research outcomes

Publication	Date of Publication	Type
Adaptable and conflict colouring multigraphs with no cycles of length three or four	2023-10-10	Paper
A variant of the Erdős–Rényi random graph process	2023-10-06	Paper
Asymptotically good edge correspondence colourings	2023-10-05	Paper
The degree-restricted random process is far from uniform	2022-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q4633816	2019-05-06	Paper
Asymptotically good edge correspondence colouring	2018-08-26	Paper
Backbone colourings of graphs	2016-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q2816123	2016-07-01	Paper
Colouring graphs when the number of colours is nearly the maximum degree	2015-02-27	Paper
Sets that are connected in two random graphs	2014-11-17	Paper
Colouring graphs when the number of colours is almost the maximum degree	2014-10-22	Paper
Inside the clustering threshold for random linear equations	2013-09-19	Paper
On the edge-density of 4-critical graphs	2011-02-08	Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques	2010-05-26	Paper
Asymptotically optimal frugal colouring	2010-04-21	Paper
Corrigendum to ``Asymptotically optimal frugal colouring [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)]	2010-04-21	Paper
Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms	2006-12-14	Paper
The satisfiability threshold for randomly generated binary constraint satisfaction problems	2006-06-06	Paper
(\(\Delta-k\))-critical graphs	2005-03-08	Paper
https://portal.mardi4nfdi.de/entity/Q4542572	2004-01-27	Paper
Random constraint satisfaction: A more accurate picture	2002-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q4344223	2001-11-26	Paper
Graph colouring and the probabilistic method	2001-09-02	Paper
Near-optimal list colorings	2000-12-19	Paper
Splitting an Expander Graph	2000-11-07	Paper
Critical subgraphs of a random graph	2000-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q4250147	1999-11-08	Paper
A bound on the total chromatic number	1999-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4224932	1999-08-17	Paper
The Size of the Giant Component of a Random Graph with a Given Degree Sequence	1999-07-19	Paper
Colouring a graph frugally	1999-03-14	Paper
Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors	1999-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q3839005	1998-08-13	Paper
The existence of uniquely \(-G\) colourable graphs	1998-03-24	Paper
https://portal.mardi4nfdi.de/entity/Q4347886	1997-08-11	Paper
A bound on the strong chromatic index of a graph	1997-05-05	Paper
Perfect Matchings in Random r-regular, s-uniform Hypergraphs	1997-03-06	Paper
Generating and Counting Hamilton Cycles in Random Regular Graphs	1996-12-16	Paper
A critical point for random graphs with a given degree sequence	1995-10-23	Paper
The dominating number of a random cubic graph	1995-10-17	Paper
Broadcasting in random graphs	1995-05-03	Paper
Hamilton Cycles in Random Regular Digraphs	1994-10-24	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael S. O. Molloy