Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs

Frantisek Kardos, Daniel Král', Jan Volec. Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms, 41(4):506-520, 2012. [doi]

Abstract

Abstract is missing.