Add to ORKGWe show that the size of maximum cut in a planar graph with $m$ edges is at least $2m/3$. We also show that maximal planar graphs saturate this bound.Comment: The main result already appeared in an answer to a question posted on math stack exchange in 201
The MAXIMUM PLANAR SUBGRAPH problem---given a graph G, find a largest planar subgraph of G---has app...
AbstractGiven a graph G with tree-width ω(G), branch-width β(G), and side size of the largest square...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
DOI 10.1002/jgt.20121 Abstract: It is known that a planar graph on n vertices has branch-width/ tree...
For a graph G, let f(G) denote the size of the maximum cut in G. The problem of estimating f(G) as a...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a nu...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
We start by familiarizing ourselves with edge covers. We review several\ud interesting results for c...
For a graph G, let f(G) denote the size of the maximum cut in G. The problem of estimating f(G) as a...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
We prove that in an undirected graph there are at most O(n 2 ) cuts of size strictly less than 3=2...
The MAXIMUM PLANAR SUBGRAPH problem---given a graph G, find a largest planar subgraph of G---has app...
AbstractGiven a graph G with tree-width ω(G), branch-width β(G), and side size of the largest square...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...
DOI 10.1002/jgt.20121 Abstract: It is known that a planar graph on n vertices has branch-width/ tree...
For a graph G, let f(G) denote the size of the maximum cut in G. The problem of estimating f(G) as a...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
AbstractLet fk(Δ) be the maximum number of vertices in a planar graph with diameter k and maximum de...
In automatic graph drawing a given graph has to be layed-out in the plane, usually according to a nu...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
We start by familiarizing ourselves with edge covers. We review several\ud interesting results for c...
For a graph G, let f(G) denote the size of the maximum cut in G. The problem of estimating f(G) as a...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
We prove that in an undirected graph there are at most O(n 2 ) cuts of size strictly less than 3=2...
The MAXIMUM PLANAR SUBGRAPH problem---given a graph G, find a largest planar subgraph of G---has app...
AbstractGiven a graph G with tree-width ω(G), branch-width β(G), and side size of the largest square...
In [JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph ...