Independence, clique size and maximum degree
From MaRDI portal
Publication:1065018
DOI10.1007/BF02579154zbMath0576.05025MaRDI QIDQ1065018
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Related Items
New bounds on the independence number of connected graphs, Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three, Perfect roman domination in regular graphs, Packing in regular graphs, Conjecture of TxGraffiti: Independence, domination, and matchings, Turán type results for distance graphs, On vertex independence number of uniform hypergraphs, A new lower bound on the independence number of a graph and applications, An improved lower bound on the independence number of a graph, Signed domination in regular graphs, Zero forcing in claw-free cubic graphs, A note on coloring vertex-transitive graphs, Transversals and independence in linear hypergraphs with maximum degree two, On line graphs of subcubic triangle-free graphs, Turán-type bounds for distance graphs, On three outer-independent domination related parameters in graphs, The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
Cites Work