External Links

    Journal: Combinatorics, Probability & Computing

    Volume 11, Issue 6

    541 -- 547Patrick Bellenbaum, Reinhard Diestel. Two Short Proofs Concerning Tree-Decompositions
    549 -- 569Stasys Jukna, Georg Schnitger. Triangle-Freeness Is Hard To Detect
    571 -- 585Joseph Samuel Myers. Graphs Without Large Complete Minors Are Quasi-Random
    587 -- 597Ralph Neininger. The Wiener Index Of Random Trees
    599 -- 605Christian M. Reidys. Distances In Random Induced Subgraphs Of Generalized N-Cubes
    607 -- 627Dudley Stark. Information Loss In Top To Random Shuffling
    629 -- 643John C. Wierman. An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability
    runs on