On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph

DOI10.1007/BF00051759zbMath0771.05051OpenAlexW1986267687MaRDI QIDQ1207353

S. Singh

Publication date: 1 April 1993

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00051759

zbMATH Keywords

multigraphenumerationspanning subgraphschromatic numbercyclomatic numberrecursive formula

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• An operator approach to some graph enumeration problems
• Enumeration of connected spanning subgraphs of a planar graph
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• Enumeration of Forests in a Graph

This page was built for publication: On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph