Pages that link to "Item:Q528993"

The following pages link to New results on \(k\)-independence of graphs (Q528993):

Displaying 15 items.

• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
• Independence in connected graphs (Q617904) (← links)
• On Turan's theorem for sparse graphs (Q1167183) (← links)
• New approach to the \(k\)-independence number of a graph (Q1953418) (← links)
• Mixed domination and 2-independence in trees (Q2132130) (← links)
• New results relating independence and matchings (Q2151222) (← links)
• New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
• MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
• New results on \(k\)-independence of hypergraphs (Q2689120) (← links)
• Multiple Domination (Q3384609) (← links)
• Improved lower bounds on <i>k</i>‐independence (Q3970967) (← links)
• A new notion of vertex independence and rank for finite graphs (Q5246507) (← links)
• Independence number of hypergraphs under degree conditions (Q6076735) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
• Complexity results on \(k\)-independence in some graph products (Q6594024) (← links)