Pages that link to "Item:Q4163261"
From MaRDI portal
The following pages link to Towards a theory of domination in graphs (Q4163261):
Displaying 50 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- On the signed total Roman domination and domatic numbers of graphs (Q317425) (← links)
- Coloring, location and domination of corona graphs (Q372395) (← links)
- Domination versus independent domination in cubic graphs (Q385388) (← links)
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- The signed Roman \(k\)-domatic number of a graph (Q476316) (← links)
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph (Q550486) (← links)
- Towards a new framework for domination (Q651449) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- The \(\{k\}\)-domatic number of a graph (Q719648) (← links)
- On domination and independent domination numbers of a graph (Q754234) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Idomatic partitions of direct products of complete graphs (Q966052) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
- The roman domatic number of a graph (Q990809) (← links)
- On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset (Q1025567) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- A note on total domination (Q1065020) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- On graphs having domination number half their order (Q1081617) (← links)
- Line domination in graphs (Q1092932) (← links)
- Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka) (Q1100480) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- Dominating sets in social network graphs (Q1108233) (← links)
- Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
- Independent domination in chordal graphs (Q1169487) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- Regular totally domatically full graphs (Q1174127) (← links)
- Domatically critical and domatically full graphs (Q1174128) (← links)
- The least point covering and domination numbers of a graph (Q1174131) (← links)
- Maximum number of edges in connected graphs with a given domination number (Q1174141) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- Efficient edge domination problems in graphs (Q1313728) (← links)
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- The domatic number problem (Q1322260) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- The diversity of domination (Q1356420) (← links)
- Strong weak domination and domination balance in a graph (Q1356427) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
