Pages that link to "Item:Q976158"

The following pages link to Minimal identifying codes in trees and planar graphs with large girth (Q976158):

Displaying 23 items.

• More results on the complexity of identifying problems in graphs (Q264560) (← links)
• On the size of identifying codes in triangle-free graphs (Q427898) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
• Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
• Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
• Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
• Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
• Identifying codes in the complementary prism of cycles (Q2132351) (← links)
• Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
• Identifying Codes in Trees and Planar Graphs (Q2851521) (← links)
• (Q2857369) (← links)
• Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
• Locating-Domination and Identification (Q3384611) (← links)
• On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
• Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
• The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
• (Q5135780) (← links)
• Identifying Codes in Line Graphs (Q5325952) (← links)
• (Q5878174) (← links)