On lower bounds for the matching number of subcubic graphs
We give a complete description of the set of triples (<i>α, β, γ</i>) of real numbers with the following property. There exists a constant <i>K</i> such that <i>αn<sub>3</sub></i> + <i>βn<sub>2</sub></i> + <i>γn<sub>...
Main Authors: | Haxell, P, Scott, A |
---|---|
Format: | Journal article |
Published: |
Wiley
2016
|
Similar Items
-
Star Coloring of Subcubic Graphs
by: Karthick T., et al.
Published: (2013-05-01) -
Interval Incidence Coloring of Subcubic Graphs
by: Małafiejska Anna, et al.
Published: (2017-05-01) -
On locally irregular decompositions of subcubic graphs
by: Olivier Baudon, et al.
Published: (2018-01-01) -
List Star Edge-Coloring of Subcubic Graphs
by: Kerdjoudj Samia, et al.
Published: (2018-11-01) -
Total Colouring of New Classes of Subcubic graphs
by: Sethuraman G, et al.
Published: (2022-07-01)