Network Flows, Minimum Coverings, and the Four-Color Conjectures

DOI10.1287/opre.24.2.272zbMath0346.90061OpenAlexW2089227369WikidataQ123336187 ScholiaQ123336187MaRDI QIDQ4116277

David B. Weinberger

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.2.272

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Packing and covering with integral feasible flows in integral supply-demand networks ⋮ Fractional covers for forests and matchings ⋮ The edge-coloring of complete hypergraphs. I ⋮ Dominants and submissives of matching polyhedra ⋮ Integral decomposition in polyhedra ⋮ Integer Rounding for Polymatroid and Branching Optimization Problems

This page was built for publication: Network Flows, Minimum Coverings, and the Four-Color Conjectures