Colour degree matrices of graphs with at most one cycle

Autor: Hillebrand, A., McDiarmid, C.

Publikováno v: In Discrete Applied Mathematics 20 August 2016 209:144-152

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Modularity of Erdős-Rényi random graphs

Autor: McDiarmid, C, Skerman, F

For a given graph $G$, each partition of the vertices has a modularity score, with higher values indicating that the partition better captures community structure in $G$. The modularity $q^*(G)$ of the graph $G$ is defined to be the maximum over all

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50da5b4da602a31c88c2db2dd9fa9a2b

Random unlabelled graphs containing few disjoint cycles

Autor: Kang, M, McDiarmid, C

We call a set B of vertices in a graph G a blocker if the graph G - B obtained from G by deleting the vertices in B has no cycles. The classical Erdos-Pósa theorem (1965) states that for each positive integer k there is a positive integer f(k) such

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1a438881cdc8438fa5d18559d17d28e0
https://doi.org/10.1002/rsa.20355

Colouring random graphs

Autor: Kang, J.R., McDiarmid, C., Beineke, L.W.

Publikováno v: Encyclopedia of Mathematics and its Applications ; 156, 199-229. Cambridge : Cambridge University Press
STARTPAGE=199;ENDPAGE=229;TITLE=Encyclopedia of Mathematics and its Applications ; 156
Beineke, L.W. (ed.), Topics in Chromatic Graph Theory, pp. 199-229

Item does not contain fulltext

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9eca81be926c9420196f71a22b99b9a
http://hdl.handle.net/2066/149771