Pages that link to "Item:Q2851521"
From MaRDI portal
The following pages link to Identifying codes in trees and planar graphs (Q2851521):
Displaying 18 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Counting and coding identity trees with fixed diameter and bounded degree (Q789398) (← links)
- Identifying \(X\)-trees with few characters (Q869997) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- On a code problem concerning planar acyclic graphs (Q3350765) (← links)
- (Q4659582) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- Commutative rings introduce a class of identifiable graphs (Q6670665) (← links)