Hypertrees (Q1808971): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans L. Bodlaender / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans L. Bodlaender / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993087 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0893-9659(98)00145-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4210863801 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hypertrees |
scientific article |
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
