Pages that link to "Item:Q5094374"
From MaRDI portal
The following pages link to Domination in Graphs: Core Concepts (Q5094374):
Displaying 38 items.
- Introduction to ``Topics on Domination'' (Q804605) (← links)
- Domination and dominator colorings in planar graphs with small diameter (Q833001) (← links)
- Upper total domination in claw-free cubic graphs (Q2084795) (← links)
- Further results on 2-distance coloring of graphs (Q2099385) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Topics in Domination in Graphs (Q5146715) (← links)
- Graphs with unique minimum specified domination sets (Q6063278) (← links)
- Partial domination in supercubic graphs (Q6080128) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
- Paired-domination game played on cycles (Q6103482) (← links)
- Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)
- A characterization of well-dominated Cartesian products (Q6124450) (← links)
- Super domination: graph classes, products and enumeration (Q6130203) (← links)
- Complexity of total dominator coloring in graphs (Q6184152) (← links)
- Common domination perfect graphs (Q6184333) (← links)
- Computation of Grundy dominating sequences in (co-)bipartite graphs (Q6184795) (← links)
- Packings in bipartite prisms and hypercubes (Q6197743) (← links)
- Optimal linear‐Vizing relationships for (total) domination in graphs (Q6201029) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
- Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set (Q6562422) (← links)
- Best possible upper bounds on the restrained domination number of cubic graphs (Q6565811) (← links)
- Domination of triangulated discs and maximal outerplanar graphs (Q6585486) (← links)
- Induced dominating sequence and ESD graphs (Q6587033) (← links)
- Local edge metric dimensions via corona products and integer linear programming (Q6590222) (← links)
- Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph (Q6611042) (← links)
- A characterization of graphs with given total coalition numbers (Q6611085) (← links)
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6611090) (← links)
- Progress towards the two-thirds conjecture on locating-total dominating sets (Q6611728) (← links)
- Paired-domination game played on paths (Q6614073) (← links)
- Efficient domination in grid graphs (Q6625100) (← links)
- Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem (Q6638677) (← links)
- Divisor 2-equitable domination in fuzzy graphs (Q6645637) (← links)
- Transversal coalitions in hypergraphs (Q6646394) (← links)
- On ( <i>k</i> , <i>ℓ</i> )-locating colorings of graphs (Q6648811) (← links)
- Total coalitions in graphs (Q6648822) (← links)
- A note on the \(P_3\)-isolation number of a graph (Q6658909) (← links)
- Paired versus double domination in forbidden graph classes (Q6659785) (← links)