Independence and matching number in graphs with maximum degree 4
From MaRDI portal
Publication:2439118
DOI10.1016/j.disc.2014.01.006zbMath1283.05205arXiv1312.0407OpenAlexW2073027126MaRDI QIDQ2439118
Publication date: 7 March 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0407
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Bounded clique cover of some sparse graphs, Triangle packings and transversals of some \(K_{4}\)-free graphs, Independence and matching number of some graphs
Cites Work