The following pages link to Distinguishing trees in linear time (Q426889):
Displaying 8 items.
- On computing the distinguishing numbers of trees and forests (Q813439) (← links)
- Identifying \(X\)-trees with few characters (Q869997) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
- Trees with distinguishing number two (Q2176156) (← links)
- On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316) (← links)
- (Q3219144) (← links)
- (Q4472520) (← links)