On [1,2]-domination in interval and circle graphs

DOI10.46298/DMTCS.13194MaRDI QIDQ6986995zbMATH OpenFDO

Authors Mohsen Alambardar Meybodi, Abolfazl Poureidi

Publication date 7 May 2025

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.13194

zbMATH Keywords

\([1, j\)-dominating set]circle graphdominating setinterval graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Dynamic programming (90C39)

Cites work

• \((1, j)\)-set problem in graphs
• \([1,2]\)-domination in graphs
• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
• \([1,2]\)-sets in graphs
• A linear algorithm for computing \(\gamma_{[1,2]}\)-set in generalized series-parallel graphs
• A unified approach to domination problems on interval graphs
• Algorithm and hardness results in double Roman domination of graphs
• An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
• Complexity of paired domination in AT-free and planar graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On the parameterized complexity of \([1,j]\)-domination problems
• Quasiperfect domination in triangular lattices
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• When an optimal dominating set with given constraints exists

This page was built for publication: On \([1,2]\)-domination in interval and circle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986995)