Hypertrees (Q1808971)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1370043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hypertrees |
scientific article; zbMATH DE number 1370043 |
Statements
Hypertrees (English)
0 references
21 August 2000
0 references
A generalization of the notion of tree to hypergraphs is introduced. A hypergraph \(H\) is called a hypertree, when the removal of any edge from \(H\) results in a disconnected hypergraph. Several basic properties and characterizations of hypertrees are discussed, amongst others with respect to cycles, bi-colorability, the dual, the transversal and the conformality.
0 references
tree
0 references
hypergraph
0 references
hypertree
0 references
characterization
0 references
0.8139873743057251
0 references
0.8105367422103882
0 references
