Pages that link to "Item:Q1953418"
From MaRDI portal
The following pages link to New approach to the \(k\)-independence number of a graph (Q1953418):
Displayed 22 items.
- Regular independent sets (Q260019) (← links)
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- Isolation in graphs (Q324891) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Simultaneous domination in graphs (Q489305) (← links)
- Independent sets in graphs (Q501998) (← links)
- New results on \(k\)-independence of graphs (Q528993) (← links)
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs (Q1727753) (← links)
- Mixed domination and 2-independence in trees (Q2132130) (← links)
- MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- New results on \(k\)-independence of hypergraphs (Q2689120) (← links)
- Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
- Multiple Domination (Q3384609) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)