Indirect counting trees in linear graphs

DOI10.1016/0016-0032(71)90013-5MaRDI QIDQ2557701zbMATH OpenOpenAlexFDO

Authors Guido O. Guardabassi

Publication date 1971

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(71)90013-5

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites work

• scientific article; zbMATH DE number 3132364 (Why is no real title available?)
• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach
• Generating formulas for the number of trees in a graph
• The identification of an incompletely partitioned network

Cited in

(1)

• Counting patterns in graphs

This page was built for publication: Indirect counting trees in linear graphs

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