Identifying X-trees with few characters

zbMATH Open1106.92052MaRDI QIDQ869997FDOQ869997

Authors: Magnus Bordewich, Charles Semple, Mike Steel 

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/126960

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A characterization of \(k\)-trees
• Bounds on the identifying codes in trees
• Identifying codes in trees and planar graphs
• Distinguishing trees in linear time
• scientific article; zbMATH DE number 823452
• Counting and coding identity trees with fixed diameter and bounded degree
• Minimal identifying codes in trees and planar graphs with large girth
• On a Characterization of Trees
• scientific article; zbMATH DE number 2147927
• Sequences Characterizing k-Trees

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05)

Cited In (4)

• Sharp upper and lower bounds on a restricted class of convex characters
• Defining a phylogenetic tree with the minimum number of \(r\)-state characters
• Phylogenetic trees defined by at most three characters
• On the information content of discrete phylogenetic characters

This page was built for publication: Identifying \(X\)-trees with few characters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869997)