Highly Influenced

# On Lower Bounds for the Matching Number of Subcubic Graphs

@article{Haxell2017OnLB, title={On Lower Bounds for the Matching Number of Subcubic Graphs}, author={Penny E. Haxell and Alex D. Scott}, journal={Journal of Graph Theory}, year={2017}, volume={85}, pages={336-348} }

- Published in Journal of Graph Theory 2017
DOI:10.1002/jgt.22063

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.

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-7 OF 7 REFERENCES

Highly Influential

Highly Influential