McDiarmid, Colin; Saller, Sophia Classes of graphs embeddable in order-dependent surfaces. (English) Zbl 1508.05043 Comb. Theory 3, No. 1, Paper No. 4, 47 p. (2023). MSC: 05C10 05C30 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{S. Saller}, Comb. Theory 3, No. 1, Paper No. 4, 47 p. (2023; Zbl 1508.05043) Full Text: DOI arXiv
McDiarmid, Colin; Scott, Alex; Withers, Paul The component structure of dense random subgraphs of the hypercube. (English) Zbl 07749476 Random Struct. Algorithms 59, No. 1, 3-24 (2021). Reviewer: Jean-Jil Duchamps (Besançon) MSC: 05C80 05C40 60C05 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Random Struct. Algorithms 59, No. 1, 3--24 (2021; Zbl 07749476) Full Text: DOI arXiv
McDiarmid, Colin; Skerman, Fiona Modularity of Erdős-Rényi random graphs. (English) Zbl 1452.05168 Random Struct. Algorithms 57, No. 1, 211-243 (2020). Reviewer: Yilun Shang (Newcastle) MSC: 05C80 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{F. Skerman}, Random Struct. Algorithms 57, No. 1, 211--243 (2020; Zbl 1452.05168) Full Text: DOI arXiv
Atkins, Ross; McDiarmid, Colin Extremal distances for subtree transfer operations in binary trees. (English) Zbl 1414.05074 Ann. Comb. 23, No. 1, 1-26 (2019). MSC: 05C05 05C12 05C35 05C76 92D15 PDFBibTeX XMLCite \textit{R. Atkins} and \textit{C. McDiarmid}, Ann. Comb. 23, No. 1, 1--26 (2019; Zbl 1414.05074) Full Text: DOI arXiv
McDiarmid, Colin; Yolov, Nikola Random perfect graphs. (English) Zbl 1405.05165 Random Struct. Algorithms 54, No. 1, 148-186 (2019). MSC: 05C80 05C17 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{N. Yolov}, Random Struct. Algorithms 54, No. 1, 148--186 (2019; Zbl 1405.05165) Full Text: DOI arXiv
McDiarmid, Colin; Przykucki, Michał On the purity of minor-closed classes of graphs. (English) Zbl 1404.05202 J. Comb. Theory, Ser. B 135, 295-318 (2019). MSC: 05C83 05C35 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{M. Przykucki}, J. Comb. Theory, Ser. B 135, 295--318 (2019; Zbl 1404.05202) Full Text: DOI arXiv Link
McDiarmid, Colin; Przykucki, Michał On the critical densities of minor-closed classes. (English) Zbl 1400.05230 Eur. J. Comb. 75, 66-91 (2019). MSC: 05C83 05C35 05C75 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{M. Przykucki}, Eur. J. Comb. 75, 66--91 (2019; Zbl 1400.05230) Full Text: DOI arXiv
Mcdiarmid, Colin; Skerman, Fiona Modularity of Erdős-Rényi random graphs. (English) Zbl 1482.05312 Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 31, 13 p. (2018). MSC: 05C80 PDFBibTeX XMLCite \textit{C. Mcdiarmid} and \textit{F. Skerman}, LIPIcs -- Leibniz Int. Proc. Inform. 110, Article 31, 13 p. (2018; Zbl 1482.05312) Full Text: DOI
McDiarmid, Colin; Mitsche, Dieter; Prałat, Pawel Clique colourings of geometric graphs. (English) Zbl 1409.05089 Electron. J. Comb. 25, No. 4, Research Paper P4.56, 20 p. (2018). MSC: 05C15 05C35 05C62 05C69 05C80 60D05 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Electron. J. Comb. 25, No. 4, Research Paper P4.56, 20 p. (2018; Zbl 1409.05089) Full Text: arXiv Link
McDiarmid, Colin; Penman, David; Iliopoulos, Vasileios Linear extensions and comparable pairs in partial orders. (English) Zbl 1412.06003 Order 35, No. 3, 403-420 (2018). Reviewer: Keith Kearnes (Boulder) MSC: 06A07 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Order 35, No. 3, 403--420 (2018; Zbl 1412.06003) Full Text: DOI arXiv
McDiarmid, Colin; Weller, Kerstin Bridge-addability, edge-expansion and connectivity. (English) Zbl 1371.05271 Comb. Probab. Comput. 26, No. 5, 697-719 (2017). MSC: 05C80 05C40 60C05 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{K. Weller}, Comb. Probab. Comput. 26, No. 5, 697--719 (2017; Zbl 1371.05271) Full Text: DOI
McDiarmid, Colin; Scott, Alex; Withers, Paul Uniform multicommodity flows in the hypercube with random edge-capacities. (English) Zbl 1364.05033 Random Struct. Algorithms 50, No. 3, 437-463 (2017). MSC: 05C21 05C82 05C80 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Random Struct. Algorithms 50, No. 3, 437--463 (2017; Zbl 1364.05033) Full Text: DOI arXiv Link
McDiarmid, Colin; Scott, Alex Random graphs from a block-stable class. (English) Zbl 1343.05137 Eur. J. Comb. 58, 96-106 (2016). MSC: 05C80 05B05 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{A. Scott}, Eur. J. Comb. 58, 96--106 (2016; Zbl 1343.05137) Full Text: DOI arXiv
McDiarmid, Colin Connectivity for bridge-alterable graph classes. (English) Zbl 1335.05101 Eur. J. Comb. 56, 33-39 (2016). MSC: 05C40 05C75 PDFBibTeX XMLCite \textit{C. McDiarmid}, Eur. J. Comb. 56, 33--39 (2016; Zbl 1335.05101) Full Text: DOI arXiv
Luczak, Malwina J.; McDiarmid, Colin Balanced routing of random calls. (English) Zbl 1314.60152 Ann. Appl. Probab. 25, No. 3, 1279-1324 (2015). MSC: 60K30 90B22 60K25 68M20 PDFBibTeX XMLCite \textit{M. J. Luczak} and \textit{C. McDiarmid}, Ann. Appl. Probab. 25, No. 3, 1279--1324 (2015; Zbl 1314.60152) Full Text: DOI arXiv Euclid
Kang, Ross J.; McDiarmid, Colin; Reed, Bruce; Scott, Alex For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set. (English) Zbl 1302.05116 Random Struct. Algorithms 45, No. 3, 343-361 (2014). MSC: 05C55 05A17 05C65 PDFBibTeX XMLCite \textit{R. J. Kang} et al., Random Struct. Algorithms 45, No. 3, 343--361 (2014; Zbl 1302.05116) Full Text: DOI
Fountoulakis, Nikolaos; Kang, Ross J.; McDiarmid, Colin Largest sparse subgraphs of random graphs. (English) Zbl 1292.05232 Eur. J. Comb. 35, 232-244 (2014). MSC: 05C80 05C60 05C75 PDFBibTeX XMLCite \textit{N. Fountoulakis} et al., Eur. J. Comb. 35, 232--244 (2014; Zbl 1292.05232) Full Text: DOI arXiv
McDiarmid, Colin; Kurauskas, Valentas Random graphs containing few disjoint excluded minors. (English) Zbl 1303.05178 Random Struct. Algorithms 44, No. 2, 240-268 (2014). MSC: 05C80 05C83 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{V. Kurauskas}, Random Struct. Algorithms 44, No. 2, 240--268 (2014; Zbl 1303.05178) Full Text: DOI arXiv
Mcdiarmid, Colin Random graphs from a weighted minor-closed class. (English) Zbl 1295.05212 Electron. J. Comb. 20, No. 2, Research Paper P52, 39 p. (2013). MSC: 05C80 05C30 PDFBibTeX XMLCite \textit{C. Mcdiarmid}, Electron. J. Comb. 20, No. 2, Research Paper P52, 39 p. (2013; Zbl 1295.05212) Full Text: arXiv Link
Law, Hiu-Fai; McDiarmid, Colin On independent sets in graphs with given minimum degree. (English) Zbl 1282.05181 Comb. Probab. Comput. 22, No. 6, 874-884 (2013). MSC: 05C69 05C35 05C07 PDFBibTeX XMLCite \textit{H.-F. Law} and \textit{C. McDiarmid}, Comb. Probab. Comput. 22, No. 6, 874--884 (2013; Zbl 1282.05181) Full Text: DOI arXiv
Addario-Berry, L.; McDiarmid, C.; Reed, B. Connectivity for Bridge-addable monotone graph classes. (English) Zbl 1253.05089 Comb. Probab. Comput. 21, No. 6, 803-815 (2012). MSC: 05C40 05C75 05C80 05C10 60C05 PDFBibTeX XMLCite \textit{L. Addario-Berry} et al., Comb. Probab. Comput. 21, No. 6, 803--815 (2012; Zbl 1253.05089) Full Text: DOI arXiv
Fountoulakis, Nikolaos; Kang, Ross J.; McDiarmid, Colin Largest sparse subgraphs of random graphs. (English) Zbl 1274.05438 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 349-354 (2011). MSC: 05C80 PDFBibTeX XMLCite \textit{N. Fountoulakis} et al., Electron. Notes Discrete Math. 38, 349--354 (2011; Zbl 1274.05438) Full Text: Link
McDiarmid, Colin; Müller, Tobias On the chromatic number of random geometric graphs. (English) Zbl 1263.05097 Combinatorica 31, No. 4, 423-488 (2011). Reviewer: David B. Penman (Colchester) MSC: 05C80 60D05 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{T. Müller}, Combinatorica 31, No. 4, 423--488 (2011; Zbl 1263.05097) Full Text: DOI arXiv
Kurauskas, Valentas; McDiarmid, Colin Random graphs with few disjoint cycles. (English) Zbl 1238.05249 Comb. Probab. Comput. 20, No. 5, 763-775 (2011). Reviewer: Ove Frank (Stockholm) MSC: 05C80 05C38 05C40 05C69 PDFBibTeX XMLCite \textit{V. Kurauskas} and \textit{C. McDiarmid}, Comb. Probab. Comput. 20, No. 5, 763--775 (2011; Zbl 1238.05249) Full Text: DOI arXiv
McDiarmid, Colin On graphs with few disjoint \(t\)-star minors. (English) Zbl 1229.05252 Eur. J. Comb. 32, No. 8, 1394-1406 (2011). MSC: 05C83 PDFBibTeX XMLCite \textit{C. McDiarmid}, Eur. J. Comb. 32, No. 8, 1394--1406 (2011; Zbl 1229.05252) Full Text: DOI
Kang, Mihyun; McDiarmid, Colin Random unlabelled graphs containing few disjoint cycles. (English) Zbl 1215.05164 Random Struct. Algorithms 38, No. 1-2, 174-204 (2011). MSC: 05C80 05C38 PDFBibTeX XMLCite \textit{M. Kang} and \textit{C. McDiarmid}, Random Struct. Algorithms 38, No. 1--2, 174--204 (2011; Zbl 1215.05164) Full Text: DOI
Kang, Ross J.; McDiarmid, Colin The \(t\)-improper chromatic number of random graphs. (English) Zbl 1207.05182 Comb. Probab. Comput. 19, No. 1, 87-98 (2010). MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{R. J. Kang} and \textit{C. McDiarmid}, Comb. Probab. Comput. 19, No. 1, 87--98 (2010; Zbl 1207.05182) Full Text: DOI arXiv
Addario-Berry, Louigi; Esperet, Louis; Kang, Ross J.; McDiarmid, Colin J. H.; Pinlou, Alexandre Acyclic improper colourings of graphs with bounded maximum degree. (English) Zbl 1185.05056 Discrete Math. 310, No. 2, 223-229 (2010). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{L. Addario-Berry} et al., Discrete Math. 310, No. 2, 223--229 (2010; Zbl 1185.05056) Full Text: DOI
McDiarmid, Colin Random graphs from a minor-closed class. (English) Zbl 1215.05167 Comb. Probab. Comput. 18, No. 4, 583-599 (2009). MSC: 05C80 05C83 05C40 05C78 PDFBibTeX XMLCite \textit{C. McDiarmid}, Comb. Probab. Comput. 18, No. 4, 583--599 (2009; Zbl 1215.05167) Full Text: DOI
McDiarmid, Colin; Reed, Bruce On the maximum degree of a random planar graph. (English) Zbl 1160.05018 Comb. Probab. Comput. 17, No. 4, 591-601 (2008). Reviewer: Ove Frank (Stockholm) MSC: 05C10 05C80 05C35 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{B. Reed}, Comb. Probab. Comput. 17, No. 4, 591--601 (2008; Zbl 1160.05018) Full Text: DOI
McDiarmid, Colin Random graphs on surfaces. (English) Zbl 1154.05021 J. Comb. Theory, Ser. B 98, No. 4, 778-797 (2008). Reviewer: Ove Frank (Stockholm) MSC: 05C10 05C80 57M15 PDFBibTeX XMLCite \textit{C. McDiarmid}, J. Comb. Theory, Ser. B 98, No. 4, 778--797 (2008; Zbl 1154.05021) Full Text: DOI
Havet, Frédéric; van den Heuvel, Jan; McDiarmid, Colin; Reed, Bruce List colouring squares of planar graphs. (English) Zbl 1341.05073 Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 515-519 (2007). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{F. Havet} et al., Electron. Notes Discrete Math. 29, 515--519 (2007; Zbl 1341.05073) Full Text: DOI arXiv
Kang, Ross J.; McDiarmid, Colin J. H. The \(t\)-improper chromatic number of random graphs. (English) Zbl 1341.05077 Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 411-417 (2007). MSC: 05C15 05C80 PDFBibTeX XMLCite \textit{R. J. Kang} and \textit{C. J. H. McDiarmid}, Electron. Notes Discrete Math. 29, 411--417 (2007; Zbl 1341.05077) Full Text: DOI
Bodirsky, Manuel; Kang, Mihyun; Löffler, Mike; McDiarmid, Colin Random cubic planar graphs. (English) Zbl 1114.05094 Random Struct. Algorithms 30, No. 1-2, 78-94 (2007). Reviewer: Ove Frank (Stockholm) MSC: 05C80 05C15 05C40 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Random Struct. Algorithms 30, No. 1--2, 78--94 (2007; Zbl 1114.05094) Full Text: DOI
McDiarmid, Colin; Reed, Bruce Concentration for self-bounding functions and an inequality of Talagrand. (English) Zbl 1120.60015 Random Struct. Algorithms 29, No. 4, 549-557 (2006). Reviewer: Tadeusz Inglot (Wrocław) MSC: 60E15 60C05 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{B. Reed}, Random Struct. Algorithms 29, No. 4, 549--557 (2006; Zbl 1120.60015) Full Text: DOI
Luczak, Malwina J.; McDiarmid, Colin On the maximum queue length in the supermarket model. (English) Zbl 1102.60083 Ann. Probab. 34, No. 2, 493-527 (2006). Reviewer: Oleg K. Zakusilo (Kyïv) MSC: 60K25 60C05 68R05 90B22 60K30 68M20 PDFBibTeX XMLCite \textit{M. J. Luczak} and \textit{C. McDiarmid}, Ann. Probab. 34, No. 2, 493--527 (2006; Zbl 1102.60083) Full Text: DOI arXiv
Luczak, Malwina J.; McDiarmid, Colin On the power of two choices: balls and bins in continuous time. (English) Zbl 1079.60016 Ann. Appl. Probab. 15, No. 3, 1733-1764 (2005). Reviewer: Michel Sortais (Berlin) MSC: 60C05 68R05 90B80 60K35 60K30 PDFBibTeX XMLCite \textit{M. J. Luczak} and \textit{C. McDiarmid}, Ann. Appl. Probab. 15, No. 3, 1733--1764 (2005; Zbl 1079.60016) Full Text: DOI arXiv
McDiarmid, Colin; Steger, Angelika; Welsh, Dominic J. A. Random planar graphs. (English) Zbl 1056.05128 J. Comb. Theory, Ser. B 93, No. 2, 187-205 (2005). MSC: 05C80 05C10 05C30 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., J. Comb. Theory, Ser. B 93, No. 2, 187--205 (2005; Zbl 1056.05128) Full Text: DOI
McDiarmid, Colin; Reed, Bruce Channel assignment on graphs of bounded treewidth. (English) Zbl 1029.05150 Discrete Math. 273, No. 1-3, 183-192 (2003). MSC: 05C90 05C15 68R10 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{B. Reed}, Discrete Math. 273, No. 1--3, 183--192 (2003; Zbl 1029.05150) Full Text: DOI
McDiarmid, Colin On the span in channel assignment problems: Bounds, computing and counting. (English) Zbl 1014.05024 Discrete Math. 266, No. 1-3, 387-397 (2003). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid}, Discrete Math. 266, No. 1--3, 387--397 (2003; Zbl 1014.05024) Full Text: DOI
McDiarmid, Colin; Reed, Bruce Channel assignment on nearly bipartite and bounded treewidth graphs. (English) Zbl 1171.05434 Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 198-201 (2001). MSC: 05C90 05C15 68R10 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{B. Reed}, Electron. Notes Discrete Math. 10, 198--201 (2001; Zbl 1171.05434) Full Text: DOI
Gerke, Stefanie; McDiarmid, Colin Graph imperfection. II. (English) Zbl 1018.05027 J. Comb. Theory, Ser. B 83, No. 1, 79-101 (2001). MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{S. Gerke} and \textit{C. McDiarmid}, J. Comb. Theory, Ser. B 83, No. 1, 79--101 (2001; Zbl 1018.05027) Full Text: DOI Link
Gerke, Stefanie; McDiarmid, Colin Graph imperfection. I. (English) Zbl 1027.05043 J. Comb. Theory, Ser. B 83, No. 1, 58-78 (2001). MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{S. Gerke} and \textit{C. McDiarmid}, J. Comb. Theory, Ser. B 83, No. 1, 58--78 (2001; Zbl 1027.05043) Full Text: DOI
Luczak, Malwina J.; McDiarmid, Colin Bisecting sparse random graphs. (English) Zbl 0968.05071 Random Struct. Algorithms 18, No. 1, 31-38 (2001). Reviewer: J.W.Moon (Edmonton) MSC: 05C80 05C70 PDFBibTeX XMLCite \textit{M. J. Luczak} and \textit{C. McDiarmid}, Random Struct. Algorithms 18, No. 1, 31--38 (2001; Zbl 0968.05071) Full Text: DOI
McDiarmid, Colin; Johnson, Theodore; Stone, Harold S. On finding a minimum spanning tree in a network with random weights. (English) Zbl 0872.60008 Random Struct. Algorithms 10, No. 1-2, 187-204 (1997). MSC: 60C05 05C05 60K20 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Random Struct. Algorithms 10, No. 1--2, 187--204 (1997; Zbl 0872.60008) Full Text: DOI
McDiarmid, Colin; Reed, Bruce Almost every graph can be covered by \(\lceil\frac{\Delta}2 \rceil\) linear forests. (English) Zbl 0852.05069 Comb. Probab. Comput. 4, No. 3, 257-268 (1995). Reviewer: Raffaele Scapellato (Milano) MSC: 05C70 05C35 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{B. Reed}, Comb. Probab. Comput. 4, No. 3, 257--268 (1995; Zbl 0852.05069) Full Text: DOI
Edwards, Keith; McDiarmid, Colin The complexity of harmonious colouring for trees. (English) Zbl 0816.05026 Discrete Appl. Math. 57, No. 2-3, 133-144 (1995). Reviewer: M.Loebl (Waterloo / Ontario) MSC: 05C15 05C05 68Q25 68R10 PDFBibTeX XMLCite \textit{K. Edwards} and \textit{C. McDiarmid}, Discrete Appl. Math. 57, No. 2--3, 133--144 (1995; Zbl 0816.05026) Full Text: DOI
McDiarmid, Colin J. H.; Sánchez-Arroyo, Abdón An upper bound for total colouring of graphs. (English) Zbl 0786.05035 Discrete Math. 111, No. 1-3, 389-392 (1993). Reviewer: M.Kubale (Gdańsk) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{C. J. H. McDiarmid} and \textit{A. Sánchez-Arroyo}, Discrete Math. 111, No. 1--3, 389--392 (1993; Zbl 0786.05035) Full Text: DOI
McDiarmid, C.; Reed, B.; Schrijver, A.; Shepherd, B. Non-interfering network flows. (English) Zbl 1502.90034 Nurmi, Otto (ed.) et al., Algorithm theory – SWAT ’92. Third Scandinavian workshop on algorithm theory, Helsinki, Finland, July 8–10, 1992. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 621, 245-257 (1992). MSC: 90B10 68R10 68Q17 68W40 PDFBibTeX XMLCite \textit{C. McDiarmid} et al., Lect. Notes Comput. Sci. 621, 245--257 (1992; Zbl 1502.90034) Full Text: DOI
McDiarmid, Colin On a correlation inequality of Farr. (English) Zbl 0798.60009 Comb. Probab. Comput. 1, No. 2, 157-160 (1992). Reviewer: O.Frank (Stockholm) MSC: 60C05 05C80 PDFBibTeX XMLCite \textit{C. McDiarmid}, Comb. Probab. Comput. 1, No. 2, 157--160 (1992; Zbl 0798.60009) Full Text: DOI
Dyer, M. E.; Füredi, Z.; McDiarmid, C. Volumes spanned by random points in the hypercube. (English) Zbl 0755.60013 Random Struct. Algorithms 3, No. 1, 91-106 (1992). Reviewer: V.Oganyan (Erevan) MSC: 60D05 60G55 52B11 PDFBibTeX XMLCite \textit{M. E. Dyer} et al., Random Struct. Algorithms 3, No. 1, 91--106 (1992; Zbl 0755.60013) Full Text: DOI
McDiarmid, Colin; Miller, Zevi Lattice bandwidth of random graphs. (English) Zbl 0733.05070 Discrete Appl. Math. 30, No. 2-3, 221-227 (1991). Reviewer: O.Frank MSC: 05C78 05C80 05C12 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{Z. Miller}, Discrete Appl. Math. 30, No. 2--3, 221--227 (1991; Zbl 0733.05070) Full Text: DOI
McDiarmid, Colin; Luo, Xinhua Upper bounds for harmonious colorings. (English) Zbl 0737.05049 J. Graph Theory 15, No. 6, 629-636 (1991). Reviewer: Liu Zhenhong (Beijing) MSC: 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{X. Luo}, J. Graph Theory 15, No. 6, 629--636 (1991; Zbl 0737.05049) Full Text: DOI
McDiarmid, Colin On the chromatic number of random graphs. (English) Zbl 0744.05047 Random Struct. Algorithms 1, No. 4, 435-442 (1990). MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid}, Random Struct. Algorithms 1, No. 4, 435--442 (1990; Zbl 0744.05047) Full Text: DOI
Frieze, A. M.; McDiarmid, C. J. H. On random minimum length spanning trees. (English) Zbl 0712.05050 Combinatorica 9, No. 4, 363-374 (1989). Reviewer: O.Frank MSC: 05C80 05C05 05C35 PDFBibTeX XMLCite \textit{A. M. Frieze} and \textit{C. J. H. McDiarmid}, Combinatorica 9, No. 4, 363--374 (1989; Zbl 0712.05050) Full Text: DOI
McDiarmid, Colin On the greedy algorithm with random costs. (English) Zbl 0616.90057 Math. Program. 36, 245-255 (1986). MSC: 90C27 05B35 PDFBibTeX XMLCite \textit{C. McDiarmid}, Math. Program. 36, 245--255 (1986; Zbl 0616.90057) Full Text: DOI
Dyer, M. E.; Frieze, A. M.; McDiarmid, C. J. H. On linear programs with random costs. (English) Zbl 0593.90061 Math. Program. 35, 3-16 (1986). Reviewer: J.Dupacova MSC: 90C15 90C08 68Q25 60H99 PDFBibTeX XMLCite \textit{M. E. Dyer} et al., Math. Program. 35, 3--16 (1986; Zbl 0593.90061) Full Text: DOI
McDiarmid, Colin On the chromatic forcing number of a random graph. (English) Zbl 0508.05055 Discrete Appl. Math. 5, 123-132 (1983). MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid}, Discrete Appl. Math. 5, 123--132 (1983; Zbl 0508.05055) Full Text: DOI
McDiarmid, Colin Integral decomposition in polyhedra. (English) Zbl 0504.90051 Math. Program. 25, 183-198 (1983). MSC: 90C10 05B35 52Bxx 05B40 PDFBibTeX XMLCite \textit{C. McDiarmid}, Math. Program. 25, 183--198 (1983; Zbl 0504.90051) Full Text: DOI
McDiarmid, Colin Achromatic numbers of random graphs. (English) Zbl 0489.05055 Math. Proc. Camb. Philos. Soc. 92, 21-28 (1982). MSC: 05C99 60C05 PDFBibTeX XMLCite \textit{C. McDiarmid}, Math. Proc. Camb. Philos. Soc. 92, 21--28 (1982; Zbl 0489.05055) Full Text: DOI
McDiarmid, Colin Blocking, antiblocking, and pairs of matroids and polymatroids. (English) Zbl 0401.05032 J. Comb. Theory, Ser. B 25, 313-325 (1978). MSC: 05B35 05B40 PDFBibTeX XMLCite \textit{C. McDiarmid}, J. Comb. Theory, Ser. B 25, 313--325 (1978; Zbl 0401.05032) Full Text: DOI
McDiarmid, Colin J. H. Bi-submodular functions, distributive valuations, and distance functions in lattices. (English) Zbl 0332.06004 Algebra Univers. 5, 253-255 (1975). MSC: 06B05 06D05 05A05 PDFBibTeX XMLCite \textit{C. J. H. McDiarmid}, Algebra Univers. 5, 253--255 (1975; Zbl 0332.06004) Full Text: DOI
McDiarmid, Colin J. H. Rado’s theorem for polymatroids. (English) Zbl 0321.05028 Math. Proc. Camb. Philos. Soc. 78, 263-281 (1975). MSC: 05B35 05C20 90B10 PDFBibTeX XMLCite \textit{C. J. H. McDiarmid}, Math. Proc. Camb. Philos. Soc. 78, 263--281 (1975; Zbl 0321.05028) Full Text: DOI