Open packing in interval graphs

DOI10.1007/S00236-026-00537-YMaRDI QIDQ7289816zbMATH OpenFDO

Authors M. Shalu, V. K. Kirubakaran

Publication date 6 July 2026

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00236-026-00537-Y

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A lower bound of the cd-chromatic number and its complexity
• A unified approach to domination problems on interval graphs
• Complexity aspects of the computation of the rank of a graph
• scientific article; zbMATH DE number 1286740 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Open packing, total domination, and the P₃-Radon number
• Packing in trees
• Total Domination in Categorical Products of Graphs

This page was built for publication: Open packing in interval graphs

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