COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II

DOI10.1073/pnas.42.4.203zbMath0073.18602OpenAlexW2092341760WikidataQ37615227 ScholiaQ37615227MaRDI QIDQ3235071

G. W. Ford, G. E. Uhlenbeck, Robert Z. Norman

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

zbMATH Keywords

Topology

Related Items (4)

Enumeration of graphs with given weighted number of connected components ⋮ The number of \(m\)-Husimi trees fixed by a permutation of the vertices ⋮ Counting bridgeless graphs ⋮ Dissimilarity Characteristic Theorems for Graphs

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