lse

Discrete Mathematics and Graph Theory

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...
Rochester Institute of Technology

Paul Wenger

MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. * Wenger, Paul S. "A Note on the Saturation ...
JSTOR Daily

SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...
Kellogg School of Management

The Equivalent Subgraph and Directed Cut Polyhedron on Series-parallel Graphs

Citations: Chopra, Sunil. 1992. The Equivalent Subgraph and Directed Cut Polyhedron on Series-parallel Graphs. SIAM Journal on Discrete Mathematics. (4)475-490.