The following pages link to (Q4368728):
Displaying 50 items.
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- On a conjecture of Murty and Simon on diameter two critical graphs. II. (Q658055) (← links)
- The maximum diameter of total domination edge-critical graphs (Q658066) (← links)
- Signed 2-independence in digraphs (Q658077) (← links)
- The \(p\)-bondage number of trees (Q659674) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← links)
- Dominator colorings in some classes of graphs (Q659760) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Signed total \((k,k)\)-domatic number of digraphs (Q662374) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Dominating set games. (Q703283) (← links)
- \(k\)-tuple total domination in graphs (Q708327) (← links)
- Restricted power domination and fault-tolerant power domination on grids (Q708342) (← links)
- Dominating sets in plane triangulations (Q708360) (← links)
- Characterization of graphs using domination polynomials (Q709243) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- On a conjecture on total domination in claw-free cubic graphs (Q710600) (← links)
- Lower negative decision number in a graph (Q711530) (← links)
- The total bondage number of grid graphs (Q714029) (← links)
- The \(\{k\}\)-domatic number of a graph (Q719648) (← links)
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees (Q726513) (← links)
- Non-isolating bondage in graphs (Q726514) (← links)
- Various bounds for liar's domination number (Q726641) (← links)
- Some variations of perfect graphs (Q726645) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- On the ratio of the domination number and the independent domination number in graphs (Q741547) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Independent domination in subcubic bipartite graphs of girth at least six (Q741773) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number (Q742633) (← links)
- Upper bounds on the signed \((k,k)\)-domatic number of digraphs (Q745940) (← links)
- A note on neighborhood total domination in graphs (Q746350) (← links)
- Total domination in inflated graphs (Q765350) (← links)
- Upper signed \(k\)-domination in a general graph (Q765509) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
