Introduction to ``Topics on Domination

DOI10.1016/0012-365X(90)90343-GzbMath0728.05056OpenAlexW4211155037MaRDI QIDQ804605

Renu C. Laskar, Stephen T. Hedetniemi

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90343-g

zbMATH Keywords

dominating setsQueens problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Graph theory (05C99)

Related Items (24)

Isolate domination in graphs ⋮ The \(k\)-neighbor, \(r\)-domination problems on interval graphs ⋮ Isolation of \(k\)-cliques. II ⋮ Dominating Cartesian products of cycles ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal covers ⋮ An efficient algorithm to solve the distancek-domination problem on permutation graphs ⋮ Decreasing the maximum degree of a graph ⋮ Algebraic approach to fasciagraphs and rotagraphs ⋮ Unnamed Item ⋮ On minimum intersection of two minimum dominating sets of interval graphs ⋮ Isolation of cycles ⋮ Characterization of \(P_{6}\)-free graphs ⋮ Isolation of \(k\)-cliques ⋮ Isolation of connected graphs ⋮ Some modified types of pitchfork domination and it's inverse ⋮ Extensions of the Art Gallery Theorem ⋮ Domination and total domination on asteroidal triple-free graphs ⋮ Improved bottleneck domination algorithms ⋮ Complete description of forbidden subgraphs in the structural domination problem ⋮ Parity dimension for graphs ⋮ Chessboard graphs, related designs, and domination parameters ⋮ Doubly connected bi-domination in graphs ⋮ On graphs whose domination numbers equal their independent domination numbers ⋮ Dominating cliques in chordal graphs

This page was built for publication: Introduction to ``Topics on Domination