Polynomial time algorithms for hop domination

DOI10.1007/978-3-031-83438-7_8MaRDI QIDQ6969507zbMATH OpenFDO

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

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_8

zbMATH Keywords

biconvex bipartite graphsdominationhop dominationinterval graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Algorithm and hardness results on hop domination in graphs
• Conflict-free coloring on claw-free graphs and interval graphs
• Exact 2-step domination in graphs
• 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

Cited in

(1)

• Hop domination on subclasses of perfect graphs

This page was built for publication: Polynomial time algorithms for hop domination

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