Counting patterns in graphs

DOI10.1016/0095-8956(72)90004-4MaRDI QIDQ5921365zbMATH OpenOpenAlexFDO

Authors Guido O. Guardabassi

Publication date 1972

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(72)90004-4

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Cites work

• A mechanical counting method and combinatorial applications
• Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• Indirect counting trees in linear graphs

This page was built for publication: Counting patterns in graphs

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