The following pages link to (Q3691779):
Displaying 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Bounds on the connected \(k\)-domination number in graphs (Q608255) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- The k-neighbor domination problem (Q811346) (← links)
- Ratios of some domination parameters in trees (Q932641) (← links)
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence (Q1069959) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- The \(k\)-neighbor, \(r\)-domination problems on interval graphs (Q1342074) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- A note on Nordhaus-Gaddum inequalities for domination. (Q1421486) (← links)
- Upper bounds for \(f\)-domination number of graphs (Q1584247) (← links)
- Generalized independence and domination in graphs (Q1584435) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Client-server and cost effective sets in graphs (Q1713579) (← links)
- Bounds on the 2-domination number (Q1744236) (← links)
- Constructing dominating sets in circulant graphs (Q1745909) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- 2-domination number of generalized Petersen graphs (Q1754639) (← links)
- A note on the global offensive alliances in graphs (Q1801085) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- A note on double domination in graphs (Q2030253) (← links)
- Bipartite graphs with close domination and \(k\)-domination numbers (Q2053423) (← links)
- Domination number, independent domination number and 2-independence number in trees (Q2214304) (← links)
- \([1,k]\)-domination number of lexicographic products of graphs (Q2227955) (← links)
- On the \(k\)-domination number of digraphs (Q2331578) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
- Graphs with \(\alpha _1\) and \(\tau _1\) both large (Q2413631) (← links)
- On the super domination number of lexicographic product graphs (Q2420416) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
- On graphs with equal domination and 2-domination numbers (Q2483412) (← links)
- Some bounds on the \(p\)-domination number in trees (Q2501539) (← links)
- On \(k\)-independence in graphs with emphasis on trees (Q2643314) (← links)
- Multiple Domination (Q3384609) (← links)
- (Open) packing number of some graph products (Q3386621) (← links)
- Limited Packings in Graphs (Q3503525) (← links)
- An upper bound for thek-domination number of a graph (Q3815347) (← links)
- Independent Roman domination and 2-independence in trees (Q4577859) (← links)
- Mixed Roman domination and 2-independence in trees (Q4583517) (← links)
- Edge domination and 2-independence in trees (Q5013448) (← links)
- Middle domination and 2-independence in trees (Q5025158) (← links)
