Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Tree (graph theory)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== * {{citation |last1=Bender |first1=Edward A. |last2=Williamson |first2=S. Gill |date=2010 |title=Lists, Decisions and Graphs. With an Introduction to Probability |url=https://books.google.com/books?id=vaXv_yhefG8C }} * {{citation | last1 = Dasgupta| first1 = Sanjoy | contribution = Learning polytrees | pages = 134β141 | title = Proc. 15th Conference on Uncertainty in Artificial Intelligence (UAI 1999), Stockholm, Sweden, JulyβAugust 1999 | url = http://cseweb.ucsd.edu/~dasgupta/papers/poly.pdf | year = 1999}}. * {{citation |last=Deo |first=Narsingh |date=1974 |title=Graph Theory with Applications to Engineering and Computer Science |url=https://www.edutechlearners.com/download/Graphtheory.pdf |archive-url=https://web.archive.org/web/20190517165158/http://www.edutechlearners.com/download/Graphtheory.pdf |archive-date=2019-05-17 |url-status=live |location=Englewood, New Jersey |publisher=Prentice-Hall |isbn=0-13-363473-6 }} *{{citation |last1=Harary |first1=Frank |author1-link=Frank Harary|last2=Prins |first2=Geert |title=The number of homeomorphically irreducible trees, and other species |journal=[[Acta Mathematica]] |date=1959 |volume=101 |issue=1β2 |pages=141β162 |doi=10.1007/BF02559543 |url=https://projecteuclid.org/euclid.acta/1485889061 |language=EN |issn=0001-5962|doi-access=free }} * {{citation | last1 = Harary | first1 = Frank | author1-link = Frank Harary | last2 = Sumner | first2 = David | mr = 603363 | issue = 3 | journal = Journal of Combinatorics, Information & System Sciences | pages = 184β187 | title = The dichromatic number of an oriented tree | volume = 5 | year = 1980}}. * {{citation | last1 = Kim | first1 = Jin H. | last2 = Pearl | first2 = Judea | contribution = A computational model for causal and diagnostic reasoning in inference engines | pages = 190β193 | title = Proc. 8th International Joint Conference on Artificial Intelligence (IJCAI 1983), Karlsruhe, Germany, August 1983 | url = https://www.ijcai.org/Proceedings/83-1/Papers/041.pdf | year = 1983}}. * {{citation | last1 = Li | first1 = Gang | contribution = Generation of Rooted Trees and Free Trees | page = 9 | title = M.S. Thesis, Dept. of Computer Science, University of Victoria, BC, Canada | url = http://webhome.cs.uvic.ca/~ruskey/Theses/GangLiMScThesis.pdf | year = 1996}}. * {{citation | last = Simion | first = Rodica | author-link = Rodica Simion | doi = 10.1016/0012-365X(91)90061-6 | mr = 1099270 | issue = 1 | journal = Discrete Mathematics | pages = 93β104 | title = Trees with 1-factors and oriented trees | volume = 88 | year = 1991| doi-access = free }}.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)