On Lower Bounds for the Matching Number of Subcubic Graphs

DOI10.1002/jgt.22063zbMath1365.05228arXiv1406.7227MaRDI QIDQ5272918

Penny E. Haxell, Alexander D. Scott

Publication date: 5 July 2017

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

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

zbMATH Keywords

matching; polyhedron; subcubic graph

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Uses Software

• polymake