Journal article
On lower bounds for the matching number of subcubic graphs
- Abstract:
- 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:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 237.3KB, Terms of use)
-
- Publisher copy:
- 10.1002/jgt.22063
Authors
- Publisher:
- Wiley
- Journal:
- Journal of Graph Theory More from this journal
- Volume:
- 85
- Issue:
- 2
- Pages:
- 336–348
- Publication date:
- 2016-01-01
- Acceptance date:
- 2016-05-15
- DOI:
- ISSN:
-
0364-9024
- Keywords:
- Pubs id:
-
pubs:632955
- UUID:
-
uuid:86b61ad8-eaa6-403e-9c5d-092ce0f08cf8
- Local pid:
-
pubs:632955
- Source identifiers:
-
632955
- Deposit date:
-
2016-07-09
Terms of use
- Copyright holder:
- Wiley Periodicals, Inc
- Copyright date:
- 2016
- Notes:
- 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
If you are the owner of this record, you can report an update to it here: Report update to this record