Name
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 ï¾źG of every connected subcubic graph G, where ni denotes the number of vertices of degree i for each i. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/jgt.22063 | Journal of Graph Theory |
Keywords | Field | DocType |
matching,subcubic graph,polyhedron | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Existential quantification,Upper and lower bounds,Real number,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 2 | 0364-9024 |
Citations | PageRank | References |
1 | 0.37 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |
| Alex Scott | 2 | 251 | 40.93 |