Restrained domination and its variants in extended supergrid graphs

DOI10.1016/j.tcs.2023.113832OpenAlexW4353055670MaRDI QIDQ2699221

Ruo-Wei Hung

Publication date: 26 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113832

zbMATH Keywords

restrained dominationgrid graphsupergrid graphrectangular supergrid graphindependent restrained dominationextended supergrid graphrectangular triangular-supergrid graphrestrained-step domination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in linear-convex supergrid graphs
• NP-completeness and APX-completeness of restrained domination in graphs
• The Hamiltonian properties of supergrid graphs
• Hamiltonian properties of triangular grid graphs
• Unit disk graphs
• Restrained domination in graphs
• The Hamiltonian connectivity of rectangular supergrid graphs
• Restrained domination in self-complementary graphs
• Restrained domination in some subclasses of chordal graphs
• The restrained domination and independent restrained domination in extending supergrid graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• The domination numbers of the 5 × n and 6 × n grid graphs
• Hamilton Paths in Grid Graphs
• Restrained domination polynomial in graphs
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs

This page was built for publication: Restrained domination and its variants in extended supergrid graphs