Independence, clique size and maximum degree
From MaRDI portal
(Redirected from Publication:1065018)
Recommendations
Cites work
Cited in
(21)- A note on coloring vertex-transitive graphs
- Conjectures of TxGraffiti: independence, domination, and matchings
- Transversals and independence in linear hypergraphs with maximum degree two
- A new lower bound on the independence number of a graph and applications
- Packing in regular graphs
- On vertex independence number of uniform hypergraphs
- scientific article; zbMATH DE number 4142085 (Why is no real title available?)
- scientific article; zbMATH DE number 5206702 (Why is no real title available?)
- Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
- Zero forcing in claw-free cubic graphs
- On line graphs of subcubic triangle-free graphs
- scientific article; zbMATH DE number 7437710 (Why is no real title available?)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
- An improved lower bound on the independence number of a graph
- Turán type results for distance graphs
- Turán-type bounds for distance graphs
- Perfect Roman domination in regular graphs
- Signed domination in regular graphs
- On three outer-independent domination related parameters in graphs
- New bounds on the independence number of connected graphs
This page was built for publication: Independence, clique size and maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065018)
