Identifying codes in graphs of given maximum degree. II. Triangle-free graphs

MaRDI QIDQ6527822arXivFDO

Authors Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tuomo Lehtilä

Published in arXiv

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

This page was built for publication: Identifying codes in graphs of given maximum degree. II. Triangle-free graphs

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