Back to Search
Start Over
Independence and matching number in graphs with maximum degree 4.
- Source :
-
Discrete Mathematics . May2014, Vol. 323, p1-6. 6p. - Publication Year :
- 2014
-
Abstract
- Abstract: We prove that and for every triangle-free graph with maximum degree at most , where is the independence number and is the matching number of , respectively. These results are sharp for a graph on vertices. Furthermore we show for -free graphs, where is the chromatic number and is the clique number of , respectively. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 323
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 94578105
- Full Text :
- https://doi.org/10.1016/j.disc.2014.01.006