Pages that link to "Item:Q2000553"
From MaRDI portal
The following pages link to Bounds on the identifying codes in trees (Q2000553):
Displaying 8 items.
- Counting and coding identity trees with fixed diameter and bounded degree (Q789398) (← links)
- Identifying \(X\)-trees with few characters (Q869997) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Choice identification of a graph (Q2440100) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- (Q4659582) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- Vertex identification in trees (Q5051441) (← links)