AbstractLet σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices. We determine σ(n, k) and characterize extremal multigraphs for every n and k. The same problem is also investigated for graphs with no multiple edges
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose r...
Given a connected unit-weighted graph, we study the Maximum k-Cutset Problem, consisting in cutting ...
AbstractLet σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices...
Abstract. We determine the maximum number of edges in a connected graph with n vertices if it contai...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
AbstractGiving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum ...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
AbstractThe Merrifield–Simmons index of a graph is defined as the total number of its independent se...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
International audienceLet G=(V,E) be an undirected connected graph. Let W be a subset of V, distinct...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose r...
Given a connected unit-weighted graph, we study the Maximum k-Cutset Problem, consisting in cutting ...
AbstractLet σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices...
Abstract. We determine the maximum number of edges in a connected graph with n vertices if it contai...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
AbstractGiving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum ...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
AbstractThe Merrifield–Simmons index of a graph is defined as the total number of its independent se...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
International audienceLet G=(V,E) be an undirected connected graph. Let W be a subset of V, distinct...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose r...
Given a connected unit-weighted graph, we study the Maximum k-Cutset Problem, consisting in cutting ...
DOI
Add to ORKG