CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS

DOI10.1515/DEMA-1991-1-218MaRDI QIDQ4007182zbMATH OpenOpenAlexFDO

Authors Zofia Majcher, Jerzy Płonka

Publication date 27 September 1992

Published in Demonstratio Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1515/dema-1991-1-218

zbMATH Keywords

connected partitionscycle matroidsgeometric latticepartition poset

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• On matroid separations of graphs
• Connectedness of matroids
• scientific article; zbMATH DE number 568812
• A characterization of connected matroids
• scientific article; zbMATH DE number 1028231

Cited in

(3)

• scientific article; zbMATH DE number 6813595 (Why is no real title available?)
• Partitions of points into simplices with k-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5
• On the activities and partitions of the vertex subsets of graphs

This page was built for publication: CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS

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