Pages that link to "Item:Q427898"
From MaRDI portal
The following pages link to On the size of identifying codes in triangle-free graphs (Q427898):
Displaying 13 items.
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Strong identification codes for graphs (Q2037550) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- (Q2857369) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- (Q5135780) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- (Q5878174) (← links)
