Indirect counting trees in linear graphs

DOI10.1016/0016-0032(71)90013-5zbMATH Open0253.05103OpenAlexW2089310087MaRDI QIDQ2557701FDOQ2557701

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

• Title not available (Why is that?)
• Generating formulas for the number of trees in a graph
• Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach
• The identification of an incompletely partitioned network
• Title not available (Why is that?)

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)