On \{k\}-Roman graphs: complexity of recognition and the case of split graphs

MaRDI QIDQ7202346arXivFDO

Authors Kenny Štorgel, Nina Chiarelli, J. Pascal Gollin, Claire Hilaire, V. Leoni, Martin Milanič

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25)

arXiv classification

math.CO

This page was built for publication: On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs

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