On the fundamental cycle set graph

DOI10.1109/TCS.1982.1085125MaRDI QIDQ3338292zbMATH OpenOpenAlexFDO

Authors Maciej M. Sysło

Publication date 1982

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcs.1982.1085125

zbMATH Keywords

spanning treeseries-parallel graphs

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Recommendations

• Series - parallel graphs and depth-first search trees
• scientific article; zbMATH DE number 844157
• Parallel recognition of series-parallel graphs
• Parallel algorithms for series parallel graphs
• scientific article; zbMATH DE number 3906530

Cited in

(3)

• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
• Series - parallel graphs and depth-first search trees

This page was built for publication: On the fundamental cycle set graph

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