Distinguishing trees in linear time
zbMATH Open1243.05214MaRDI QIDQ426889FDOQ426889
Authors: Antoni Lozano, Mercè Mora, Carlos Seara 
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p19
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On computing the distinguishing numbers of trees and forests
- Trees with distinguishing number two
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
- Distinguishability of locally finite trees
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (8)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Title not available (Why is that?)
- A note on the asymptotic and computational complexity of graph distinguishability
- Trees with distinguishing number two
- Title not available (Why is that?)
- On the Complexity of Extracting Subtree with Keeping Distinguishability
- On computing the distinguishing numbers of trees and forests
- Identifying \(X\)-trees with few characters
This page was built for publication: Distinguishing trees in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426889)
