Introduction to ``Topics on Domination
From MaRDI portal
Publication:804605
DOI10.1016/0012-365X(90)90343-GzbMATH Open0728.05056OpenAlexW4211155037MaRDI QIDQ804605FDOQ804605
Authors: Stephen T. Hedetniemi, Renu C. Laskar 
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
Recommendations
- Topics in Domination in Graphs
- Domination in discrete structures -- new directions
- scientific article; zbMATH DE number 1124608
- scientific article; zbMATH DE number 1052841
- scientific article; zbMATH DE number 1095172
- An introduction to \((1,2)\)-domination graphs
- Domination in Graphs: Core Concepts
- scientific article; zbMATH DE number 1095171
- An introduction to game domination in graphs
- scientific article; zbMATH DE number 1161247
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Graph theory (05C99)
Cited In (24)
- Dominating cliques in chordal graphs
- On graphs whose domination numbers equal their independent domination numbers
- Parity dimension for graphs
- Chessboard graphs, related designs, and domination parameters
- Isolation of connected graphs
- Isolate domination in graphs
- Decreasing the maximum degree of a graph
- Complete description of forbidden subgraphs in the structural domination problem
- Doubly connected bi-domination in graphs
- Characterization of \(P_{6}\)-free graphs
- Extensions of the Art Gallery Theorem
- Isolation of cycles
- Isolation of \(k\)-cliques
- Domination in graphoidally covered graphs: least-kernel graphoidal covers
- Improved bottleneck domination algorithms
- Some modified types of pitchfork domination and it's inverse
- Algebraic approach to fasciagraphs and rotagraphs
- Domination and total domination on asteroidal triple-free graphs
- The \(k\)-neighbor, \(r\)-domination problems on interval graphs
- Dominating Cartesian products of cycles
- On minimum intersection of two minimum dominating sets of interval graphs
- Title not available (Why is that?)
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- Isolation of \(k\)-cliques. II
This page was built for publication: Introduction to ``Topics on Domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804605)
