Rainbow perfect domination in lattice graphs
DOI10.5614/EJGTA.2018.6.1.7zbMATH Open1467.05187OpenAlexW2797120489WikidataQ130001052 ScholiaQ130001052MaRDI QIDQ5009971FDOQ5009971
Authors: Luis R. Fuentes, Carlos A. G. jun. Araújo, Italo J. Dejter 
Publication date: 23 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2018.6.1.7
Recommendations
- Rainbow domination and related problems on some classes of perfect graphs
- Rainbow domination in graphs
- Rainbow domination in graphs
- On rainbow domination numbers of graphs
- Rainbow dominator coloring in graphs
- Rainbow edge domination numbers in graphs
- Global rainbow domination in graphs
- On \(k\)-rainbow domination in regular graphs
- Independent rainbow domination of graphs
- Rainbow domination numbers on graphs with given radius
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Lattice packing and covering (number-theoretic aspects) (11H31)
Cites Work
- Title not available (Why is that?)
- Perfect codes in graphs
- Rainbow trees in graphs and generalized connectivity
- Rainbow connection in graphs
- Title not available (Why is that?)
- Hardness and algorithms for rainbow connection
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Perfect domination in regular grid graphs
- Encyclopedia of distances
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dominating sets in n‐cubes
- Lattice-like total perfect codes
- Product Constructions for Perfect Lee Codes
- Total perfect codes in grid graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect domination in rectangular grid graphs
- Perfect codes in Cartesian products of 2-paths and infinite paths
- Tilings by \((0.5,n)\)-crosses and perfect codes
- Constructing covering codes with given automorphisms
- A Taxonomy of Perfect Domination
- A generalization of Lee codes
- Title not available (Why is that?)
- There is but one PDS in \(\mathbb{Z}^3\) inducing just square components
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Rainbow perfect domination in lattice graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009971)
