Identifying codes in bipartite graphs of given maximum degree

DOI10.1016/J.PROCS.2023.08.225MaRDI QIDQ6885239zbMATH OpenFDO

Authors Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä

Publication date 11 December 2025

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

Full work available at URL https://doi.org/10.1016/J.PROCS.2023.08.225

zbMATH Keywords

treesidentifying codesmaximum degreebipartite graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(4)

• Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
• A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
• Identifying codes in graphs of given maximum degree: characterizing trees
• Identifying codes in triangle-free graphs of bounded maximum degree

This page was built for publication: Identifying codes in bipartite graphs of given maximum degree

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