COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III

DOI10.1073/pnas.42.8.529zbMath0073.18603OpenAlexW4214943393WikidataQ37616157 ScholiaQ37616157MaRDI QIDQ3235072

G. E. Uhlenbeck, G. W. Ford

Publication date: 1956

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.42.8.529

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (8)

Counting unlabeled structures ⋮ Enumeration of labeled connected graphs with given order and size ⋮ Matching polynomials for chains of cycles ⋮ On the combinatorics of leftist trees ⋮ Chain hexagonal cacti: matchings and independent sets ⋮ On an asymptotic method in enumeration ⋮ Eigenvalue distribution of some nonlinear models of random matrices ⋮ Counting and coding identity trees with fixed diameter and bounded degree

This page was built for publication: COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III