Forest decompositions of graphs with cyclomatic number 3

DOI10.1155/S0161171283000484zbMATH Open0535.05023OpenAlexW2143306530MaRDI QIDQ790822FDOQ790822

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

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

zbMATH Keywords

spanning treescyclomatic numbertree polynomials

Mathematics Subject Classification ID

Trees (05C05)

Cited In (3)

• Simple planar graph partition into three forests
• On the number of components of a graph
• On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph

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)