The following pages link to (Q4711489):
Displaying 14 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- The k-neighbor domination problem (Q811346) (← links)
- A note on the global offensive alliances in graphs (Q1801085) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Bipartite graphs with close domination and \(k\)-domination numbers (Q2053423) (← links)
- Upper bounds on the global offensive alliances in graphs (Q2217469) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems (Q2686849) (← links)
- New results on \(k\)-independence of hypergraphs (Q2689120) (← links)
