Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 222

The DOI matches its Crossref record.

Comparison of labeled trees with valency three

Open access
Robinson, D.F·1971·Journal of Combinatorial Theory, Series B

Abstract

Abstract This paper is concerned with the sets of trees with all interior vertices of valency three and the terminal vertices labeled from a given set. Some of the properties of such trees are investigated and a “crossover” operation defined, leading to a distance between trees. Results towards the calculation of the probability of two trees being at most a certain distance apart are produced. Finally a connection with manipulation in semigroups is pointed out.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0095-8956(71)90020-7

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 222

Metadata

Authors
Robinson, D. F.
Venue
Journal of Combinatorial Theory, Series B
Publisher
Elsevier BV
Published
1971-10
Volume
11
Issue
2
Pages
105-119
ISSN
0095-8956 (ISSN-L)
OpenAlex
W2065722925
Cited by
222
References
0
FWCI
0.00
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Comparison of labeled trees with valency three. https://app.cochat.ai/papers/10.1016/0095-8956(71)90020-7
The paper
Robinson, D. F. (1971). Comparison of labeled trees with valency three. Journal of Combinatorial Theory, Series B. https://doi.org/10.1016/0095-8956(71)90020-7

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.