Pages that link to "Item:Q1065018"
From MaRDI portal
The following pages link to Independence, clique size and maximum degree (Q1065018):
Displaying 17 items.
- Turán type results for distance graphs (Q331389) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Signed domination in regular graphs (Q1815329) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Turán-type bounds for distance graphs (Q2411797) (← links)
- On three outer-independent domination related parameters in graphs (Q2656960) (← links)
- The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
- Perfect roman domination in regular graphs (Q5155702) (← links)
- Packing in regular graphs (Q5375889) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
