The following pages link to Colin J. H. McDiarmid (Q1227010):
Displayed 50 items.
- Connectivity for bridge-alterable graph classes (Q281926) (← links)
- Random graphs from a weighted minor-closed class (Q396764) (← links)
- The limit distribution of the number of nodes in low strata of random mapping (Q584285) (← links)
- On graphs with few disjoint \(t\)-star minors (Q648995) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- An upper bound for total colouring of graphs (Q686500) (← links)
- Random graphs from a block-stable class (Q739054) (← links)
- Item:Q1227010 (redirect page) (← links)
- Item:Q800826 (redirect page) (← links)
- Item:Q234397 (redirect page) (← links)
- Item:Q234397 (redirect page) (← links)
- Item:Q800826 (redirect page) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- Lattice bandwidth of random graphs (Q810061) (← links)
- On the improvement per iteration in Karmarkar's algorithm for linear programming (Q918862) (← links)
- On random minimum length spanning trees (Q923108) (← links)
- Random graphs on surfaces (Q933680) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- The \(t\)-stability number of a random graph (Q976708) (← links)
- Uniform multicommodity flow through the complete graph with random edge-capacities (Q1038093) (← links)
- The complexity of counting homeomorphs (Q1058852) (← links)
- Hamiltonian cycles in random regular graphs (Q1063002) (← links)
- On some conditioning results in the probabilistic analysis of algorithms (Q1063418) (← links)
- On continuum percolation (Q1073466) (← links)
- Coloring planar perfect graphs by decomposition (Q1093649) (← links)
- Maximum matchings in a class of random graphs (Q1093654) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- A polynomial time approximation algorithm for dynamic storage allocation (Q1176726) (← links)
- Choosing a spanning tree for the integer lattice uniformly (Q1180570) (← links)
- Star arboricity (Q1204531) (← links)
- On the number of systems of distinct representatives in an independence structure (Q1227011) (← links)
- Bi-submodular functions, distributive valuations, and distance functions in lattices (Q1227634) (← links)
- Blocking, antiblocking, and pairs of matroids and polymatroids (Q1255012) (← links)
- Random minimum length spanning trees in regular graphs (Q1288911) (← links)
- Colouring proximity graphs in the plane (Q1297436) (← links)
- Total colouring regular bipartite graphs is NP-hard (Q1313834) (← links)
- Sharing jugs of wine (Q1322280) (← links)
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) (Q1333324) (← links)
- Hamilton cycles in a class of random directed graphs (Q1333332) (← links)
- The random cluster process (Q1344626) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- A doubly cyclic channel assignment problem (Q1382286) (← links)
- On-line routing of random calls in networks (Q1396752) (← links)
- Channel assignment on graphs of bounded treewidth (Q1417576) (← links)
- Frequency-distance constraints with large distances (Q1587609) (← links)
- Channel assignment with large demands (Q1599337) (← links)
- On the critical densities of minor-closed classes (Q1621066) (← links)
- On the purity of minor-closed classes of graphs (Q1719590) (← links)
- Recognition of unipolar and generalised split graphs (Q1736638) (← links)
- Random planar graphs (Q1767669) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)