On Operator and Formal Sum Methods for Graph Enumeration Problems

DOI10.1137/0605038zbMath0549.05020OpenAlexW2112518004MaRDI QIDQ3342592

No author found.

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605038

zbMATH Keywords

planar graphcyclomatic numberspanning subgraphgraphical enumerationspanning forest

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (4)

Enumeration of Hamiltonian Cycles and Paths in a Graph ⋮ Enumeration of Forests in a Graph ⋮ An Operator Approach to the Principle of Inclusion and Exclusion ⋮ On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph

Cites Work

• An operator approach to some graph enumeration problems
• Enumeration of connected spanning subgraphs of a planar graph
• Enumeration of Forests in a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: On Operator and Formal Sum Methods for Graph Enumeration Problems