Forest decompositions of graphs with cyclomatic number 3

DOI10.1155/S0161171283000484MaRDI QIDQ790822zbMATHOpenAlexFDO

Authors E. J. Farrell

Publication date 1983

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/45288

zbMATH Keywords

spanning treescyclomatic numbertree polynomials

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph
• Countingk-component forests of a graph
• scientific article; zbMATH DE number 4112610
• scientific article; zbMATH DE number 3966096
• scientific article; zbMATH DE number 3959470

Cited in

(4)

• On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph
• On the number of components of a graph
• \(D\)-graphs for graphs with cyclomatic number 1.
• Simple planar graph partition into three forests

This page was built for publication: Forest decompositions of graphs with cyclomatic number 3

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