On lower bounds for the matching number of subcubic graphs
- We give a complete description of the set of triples (α, β, γ) of real numbers with the following property. There exists a constant K such that αn3 + βn2 + γn1 - K is a lower bound for the matching number v(G) of every connected subcubic graph G, where ni denotes the number of vertices of degree i for each i.
- Publication status:
- Peer review status:
- Peer reviewed
- Accepted Manuscript
- Copyright holder:
- Wiley Periodicals, Inc.
- Copyright date:
Copyright © 2016 Wiley Periodicals, Inc. This is the accepted manuscript version of the article. The final version is available online from Wiley at: https://doi.org/10.1002/jgt.22063
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record