Distance-2-matchings of random graphs

DOI10.1007/S00026-004-0207-5zbMath1055.05139OpenAlexW2100349353MaRDI QIDQ1889893

Christian M. Reidys

Publication date: 13 December 2004

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-004-0207-5

zbMATH Keywords

martingalerandom graphinduced matchingdistance-2-matching

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem

This page was built for publication: Distance-2-matchings of random graphs