Hop domination on subclasses of perfect graphs

DOI10.1016/J.TCS.2025.115547MaRDI QIDQ6896781zbMATH OpenFDO

Authors D. Karthika, R. Muthucumaraswamy, Sriram Bhyravarapu, Pritesh Kumar

Publication date 21 November 2025

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

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115547

zbMATH Keywords

biconvex bipartite graphsdominationhop dominationinterval graphspermutation graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A unified approach to domination problems on interval graphs
• Algorithm and hardness results on hop domination in graphs
• Conflict-free coloring on claw-free graphs and interval graphs
• Domination on Cocomparability Graphs
• Exact 2-step domination in graphs
• Fundamentals of parameterized complexity
• Hop domination in graphs. II
• On 2-step and hop dominating sets in graphs
• On exact \(n\)-step domination
• On list coloring and list homomorphism of permutation and interval graphs
• On total domination and hop domination in diamond-free graphs
• Parameterized algorithms
• Polynomial time algorithms for hop domination
• Total domination in graphs

This page was built for publication: Hop domination on subclasses of perfect graphs

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