Enumeration of connected spanning subgraphs of a planar graph
From MaRDI portal
Publication:1053032
DOI10.1007/BF01994058zbMath0517.05044MaRDI QIDQ1053032
Publication date: 1983
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (8)
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Combinatorial aspects of network reliability ⋮ Invulnerability of planar two-tree networks ⋮ An Operator Approach to the Principle of Inclusion and Exclusion ⋮ On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph ⋮ On Operator and Formal Sum Methods for Graph Enumeration Problems ⋮ An operator approach to some graph enumeration problems ⋮ Network reliability: Numbers or insight? (A discussion paper)
Cites Work
This page was built for publication: Enumeration of connected spanning subgraphs of a planar graph
