Generalized flowers in k-connected graphs. II

DOI10.1007/S10958-014-2197-0MaRDI QIDQ906760zbMATH OpenOpenAlexFDO

Authors Alexander Glazman

Publication date 29 January 2016

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-014-2197-0

zbMATH Keywords

\(k\)-connected graphs\(k\)-cutsetsgeneralized flowers

Mathematics Subject Classification ID

Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Generalized flowers in \(k\)-connected graphs
• scientific article; zbMATH DE number 1404133
• The structure of 4-flowers of vertically 4-connected matroids
• Blocks in \(k\)-connected graphs
• The tree of cuts and minimal \(k\)-connected graphs

Cites work

• scientific article; zbMATH DE number 5161490 (Why is no real title available?)
• scientific article; zbMATH DE number 1960407 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• The decomposition of graphs into \(k\)-connected components

Cited in

(5)

• Generalized flowers in \(k\)-connected graphs
• THE ECCENTRIC DIGRAPH OF A GENERALIZED FLOWER GRAPH
• The structure of 4-flowers of vertically 4-connected matroids
• The flower conjecture in special classes of graphs
• THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE

This page was built for publication: Generalized flowers in \(k\)-connected graphs. II

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