Category:Tree (graph theory)

Category:Uses of Wikidata Infobox
árbol; 樹狀圖; fa; дерево; Baum; Alber (matematega); pemë; Стабло; Дърво; træ; ağaç; 木; 树; träd; Arboro (matematiko); עץ; arbore; 樹; 树; tree; puu; teɛ; arbo; strom; மரம் (கோட்டுருவியல்); albero; Strom; arbre; cây; дрэва; 樹; árvore; 樹; 树; drzewo; ต้นไม้; Stablo; درخت; koks; дерево; стабло; drevo; درخت; medis; 树; pohon; tre; tre; boom; arbre; Stablo (teorija grafova); Йывăç (графсен теорийĕ); Puu (graafiteooria); árbore; شجرة; Δέντρο; 트리; grafo en el que cualesquiera dos vértices están conectados por exactamente un camino; graphe non orienté, connecté et acyclique; неарыентаваны, зьвязны ацыклічны граф; 無向連通無環圖; terme en teoria de grafs; neusmerjen, povezan in acikličen graf; ungerichteter zusammenhängender azyklischer Graph; yönsüz, bağlantılı ve döngüsel olmayan grafik; grafik i drejtuar, i lidhur dhe aciklik; بخشی از نظریه گراف; undirected, connected and acyclic graph; graf; graf aciclic, conex, neorientat; グラフ理論の用語; irányítatlan, összefüggő, körmentes gráf; связный ациклический граф; graf yang tak berarah, terhubung, dan asiklik; spójny graf bez cykli; begrep innen grafteori; urettet, sammenkoblet og asyklisk graf; niet-gerichte samenhangende cycelvrije graaf; 無向連通無環圖; grafo non orientato, connesso e aciclico; גרף קשיר ללא מעגלים; graafi; grafo non orientado, conexo e acíclico; koneksa sencikla grafo; neorientovaný souvislý graf bez kružnic; bondemannewullaa naŋ tagera kyɛ lanna taa yele; 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
tree 
undirected, connected and acyclic graph
Upload media
Instance of
  • class of graphs with few cliques
Subclass of
  • connected graph
  • forest
  • pseudotree
  • uniquely colorable graph
  • hypertree
  • block graph
Named after
Has use
Different from
Said to be the same asfree tree
Authority file
Wikidata Q272735
GND ID: 4004849-4
Library of Congress authority ID: sh85137259
NL CR AUT ID: ph127444
BabelNet ID: 03260986n
J9U ID: 987007548784505171
Edit infobox data on Wikidata

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

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

Category:Graph families Category:Undirected planar graphs Category:Uses of Wikidata Infobox