scientific article; zbMATH DE number 15162

From MaRDI portal
Publication:3977501





[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.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977501)