Unrooted binary tree
In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.
- Comment
- enIn mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.
- Depiction
- Has abstract
- enIn mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.
- Hypernym
- Tree
- Is primary topic of
- Unrooted binary tree
- Label
- enUnrooted binary tree
- Link from a Wikipage to an external page
- www.cs.uga.edu/~rwr/publications/binary.pdf
- infoscience.epfl.ch/record/97874/files/jalgs.pdf
- www.combinatorics.org/Volume_3/PDFFiles/v3i1r30.pdf
- Link from a Wikipage to another Wikipage
- Binary tree
- Branch-decomposition
- Category:Trees (graph theory)
- Cladistics
- Common ancestor
- Connected graph
- Cycle (graph theory)
- Data structure
- Degree (graph theory)
- Double factorial
- Dynamic programming
- Evolutionary tree
- Family of sets
- File:An example of an unrooted binary tree with four leaves.pdf
- File:TreeActinobacteria.svg
- Free tree
- Graph enumeration
- Hierarchical clustering
- Kraft–McMillan inequality
- Laurence Wolsey
- Maximal element
- Maximum parsimony
- Ordered tree
- Phylogenetic tree
- Planar graph
- Quartet distance
- Raffaele Pesenti
- Ternary tree
- Theory of evolution
- Treewidth
- Undirected graph
- Vertex (graph theory)
- SameAs
- 4wjZx
- m.0ch30s6
- Q7897401
- Некореневе двійкове дерево
- Некорневое двоичное дерево
- Subject
- Category:Trees (graph theory)
- Thumbnail
- WasDerivedFrom
- Unrooted binary tree?oldid=1081059657&ns=0
- WikiPageLength
- 14319
- Wikipage page ID
- 27950476
- Wikipage revision ID
- 1081059657
- WikiPageUsesTemplate
- Template:Citation
- Template:Cite arXiv
- Template:Main
- Template:OEIS
- Template:Reflist
