Flows in infinite graphs

DOI10.1016/S0021-9800(70)80006-0MaRDI QIDQ5577696zbMATH OpenOpenAlexFDO

Authors Jon Folkman, D. R. Fulkerson

Publication date 1970

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(70)80006-0

zbMATH Keywords

topology

Cited in

(19)

• Bipartite toughness and \(k\)-factors in bipartite graphs
• Factors in graphs with odd-cycle property
• k-regular factors and semi-k-regular factors in bipartite graphs
• A principle of symmetry in networks
• Sufficient regularity conditions for common transversals
• Parameters and fractional factors in different settings
• Factors of bi-regular bipartite graphs
• Fractional matching preclusion number of graphs and the perfect matching polytope
• Strong \(f\)-star factors of graphs
• Maximum-throughput dynamic network flows
• Extensions to 2-factors in bipartite graphs
• Generalizations of marriage theorem for degree factors
• Existence theorem for infinite integral matrices
• Common Partial Transversals and Integral Matrices
• Turán-type problems on \([a, b]\)-factors of graphs, and beyond
• Factors of bipartite graphs with degree conditions imposed on each partite set
• Completing multi-Latin rectangles via factors with prescribed degrees in bipartite graphs
• Bipartite binding number, k-factor and spectral radius of bipartite graphs
• Eigenvalues and factors: a survey

This page was built for publication: Flows in infinite graphs

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