A greedy algorithm for finding a large 2‐matching on a random cubic graph

DOI10.1002/jgt.22224zbMath1393.05238arXiv1209.6570OpenAlexW2963956266MaRDI QIDQ4581276

Patrick Bennett, Deepak Bal, Tom Bohman, Alan M. Frieze

Publication date: 16 August 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.6570

zbMATH Keywords

greedy algorithm2-matchingrandom cubic graph

Mathematics Subject Classification ID

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

Related Items (1)

On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three

This page was built for publication: A greedy algorithm for finding a large 2‐matching on a random cubic graph