The existence of infinitely many primary trees (Q1343258): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The existence of infinitely many primary trees |
scientific article |
Statements
The existence of infinitely many primary trees (English)
0 references
1 February 1995
0 references
Primary graphs were introduced by \textit{P. Chinn} and the second author in [Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 125-139 (1991; Zbl 0751.05073)] as a possible analogue of the basis of vector spaces for finite simple graphs. It is shown that infinitely many primary trees exist in the family of all trees with diameter 4.
0 references
bipartite graphs
0 references
primary trees
0 references
