The mincut graph of a graph

DOI10.5614/EJGTA.2026.14.1.3MaRDI QIDQ7250295zbMATH OpenFDO

Authors C. W. Kriel, Eunice Mphako-Banda

Publication date 20 May 2026

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/EJGTA.2026.14.1.3

zbMATH Keywords

connectivityedge-cut setgraph operatorintersection graphmincut

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A generalization of line graphs: (X, Y)-intersection graphs
• A matroid approach to finding edge connectivity and packing arborescences
• Algorithmic graph theory and perfect graphs
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• Graphs \& digraphs
• Graphs with largest number of minimum cuts
• Handbook of Graph Theory
• scientific article; zbMATH DE number 1161249 (Why is no real title available?)
• scientific article; zbMATH DE number 851097 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On the Number of Minimum Cuts in a Graph
• Results on the edge-connectivity of graphs
• The interchange graph of a finite graph
• The Representation of a Graph by Set Intersections
• Topics in Intersection Graph Theory

This page was built for publication: The mincut graph of a graph

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