No label defined (Q3977501)
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 15162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15162 |
Statements
25 June 1992
0 references
binding number
0 references
pseudobivariegated trees
0 references
[For the entire collection see Zbl 0679.00004.] A tree is bivariegated if its vertex set can be partitioned into two sets having the same cardinality such that each vertex is adjacent to one and only one vertex in the set not containing it. A tree \(T\) is pseudobivariegated if it contains a vertex \(v\) such that \(T-v\) is bivariegated. The binding number of pseudobivariegated trees is discussed in this paper, together with the structure of its realizing sets.
0 references