COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II

DOI10.1073/PNAS.42.4.203zbMATH Open0073.18602OpenAlexW2092341760WikidataQ37615227 ScholiaQ37615227MaRDI QIDQ3235071FDOQ3235071

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

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

Cited In (4)

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

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

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