Wikimore

**tree**
	undirected, connected and acyclic graph
	Upload media
	Wikipedia
Instance of	class of graphs with few cliques; mathematical concept; hereditary graph class;
Subclass of	connected graph; forest; pseudotree; uniquely colorable graph; hypertree; block graph; k-tree (1);
Named after	tree;
Has use	tree structure;
Different from	Baum ;
Said to be the same as	free tree
Authority file
	Q272735; GND ID: 4004849-4; Library of Congress authority ID: sh85137259; NL CR AUT ID: ph127444; BabelNet ID: 03260986n; National Library of Israel J9U ID: 987007548784505171
	Reasonator; Scholia; Wikidocumentaries; PetScan; statistics; WikiMap; Locator tool; KML file; Search depicted;

The article Tree (graph theory) on Wikipedia projects:

(en) Tree (graph theory)

Category:Uses of Wikidata Infobox

árbol; 樹狀圖; fa; дерево; Baum; Alber (matematega); pemë; Стабло; Дърво; træ; ağaç; 木; 树; Arboro (matematiko); träd; strom; עץ; tree; 樹; 树; Strom; puu; teɛ; arbo; дрво; மரம் (கோட்டுருவியல்); albero; cây; arbre; 樹; дрэва; árvore; 樹; arbre; drzewo; ต้นไม้; 树; Stablo; дерево; koks; درخت; стабло; drevo; medis; درخت; 树; pohon; tre; tre; boom; Stablo (teorija grafova); Йывăç (графсен теорийĕ); Puu (graafiteooria); arbore; árbore; شجرة; Δέντρο; 트리; grafo en el que cualesquiera dos vértices están conectados por exactamente un camino; graphe non orienté, connecté et acyclique; неарыентаваны, зьвязны ацыклічны граф; 無向連通無環圖; neusmerjen, povezan in acikličen graf; terme en teoria de grafs; irányítatlan, összefüggő, körmentes gráf; ungerichteter zusammenhängender azyklischer Graph; undirected, connected and acyclic graph; grafik i drejtuar, i lidhur dhe aciklik; بخشی از نظریه گراف; yönsüz, bağlantılı ve döngüsel olmayan grafik; graf; graf aciclic, conex, neorientat; グラフ理論の用語; связный ациклический граф; grafo non orientato, connesso e aciclico; กราฟที่สองจุดยอดใด ๆ จะมีวิถีเดินทางถึงกันได้เพียงวิถีเดียว; spójny graf bez cykli; begrep innen grafteori; urettet, sammenkoblet og asyklisk graf; niet-gerichte samenhangende cycelvrije graaf; 無向連通無環圖; גרף קשיר ללא מעגלים; graf yang tak berarah, terhubung, dan asiklik; graafi; bondemannewullaa naŋ tagera kyɛ lanna taa yele; koneksa sencikla grafo; neorientovaný souvislý graf bez kružnic; grafo non orientado, conexo e acíclico; arbol; fagráf; дрэва-граф; дерево-граф; дерево (граф); граф-дерево; azyklisch zusammenhängender Graph; Baumgraph; cây nhị phân; rừng; degë; 樹; Стабло; drevesna struktura; Tree (graph theory; ทรี; กราฟต้นไม้; Stromový graf; skog; גרף עץ; עץ מכוון; Aprėpties medis; Miškas; tree graph; albero non ordinato; albero ordinato; 樹状構造; 樹形図; 樹状図; ツリー; 포레스트; 수형도; grafo de árbore; Gepatro; Arbo-ordo; Radikhava arbo; Nereduktebla arbo; Direktita arbo; Folio; Infano; Serio-malpligrandigita arbo; Arba ordo; Senradika arbo; Orda arbo; Дървовидна структура; teɛ bondemannewulaa

A tree in mathematics and graph theory is an undirected graph in which any two vertices are connected by exactly one simple path. In other words, any connected graph without simple cycles is a tree. A forest is a disjoint union of trees.

Category:Undirected planar graphs Category:Graph families

Wikimore

Category:Tree (graph theory)

Pages in category "Category:Tree (graph theory)"