Gallery
The graphs are coded with python to a .csv format, then drawn with Gephi (open source) using Force Atlas 2. You can use them free of charges (attribution demanded, creative commons licence CC-BY).
Uniform trees with fixed degrees sequence.
Looptrees of uniform trees with fixed degrees sequence.
Connected components in critical hypercube percolation
(2^m with p=1/(m-1)+7/(2m^3) with m=13,m=14, m=17. And for the 4th, m=17 with p=1/(m-1)+12/m^3).
For m=17 we only keep the components with at least 50 vertices)
Connected components in critical site hypercube percolation
(m=20, we only keep the components with at least 50 vertices, cycles are thicker and red)
Minimum spanning trees of hypercube (m=12)
Minimum spanning trees of complete graph (4000 vertices, for comparison with hypercube)