scientific article; zbMATH DE number 3603293

Cited in

(61)

On the existence of edge cuts leaving several large components
On the shape of decomposable trees
On spanning tree congestion
On the complexity of partitioning graphs into connected subgraphs
Graph minors. V. Excluding a planar graph
Fault-tolerant routings in a -connected network
Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
Steiner intervals in graphs
The even adjacency split problem for graphs
Almost-spanning subgraphs with bounded degree in dense graphs
Partitioning a graph into balanced connected classes: formulations, separation and experiments
A diameter-revealing proof of the Bondy-Lovász lemma
Approximation algorithms for the maximally balanced connected graph tripartition problem
Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
More aspects of arbitrarily partitionable graphs
Arc-routing for winter road maintenance
Partitioning the Cartesian product of a tree and a cycle
Decomposition of a 2-connected graph into three connected subgraphs
Communication in m-connected graphs
A linear-time algorithm for four-partitioning four-connected planar graphs
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
Partitioning powers of traceable or Hamiltonian graphs
A plane graph representation of triconnected graphs
On minimal arbitrarily partitionable graphs
Spanning tree congestion and computation of generalized Győri-Lovász partition
A Survey on Spanning Tree Congestion
Structural properties of recursively partitionable graphs with connectivity 2
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
An Ore-type condition for arbitrarily vertex decomposable graphs
An Ore-type condition for arbitrarily vertex decomposable graphs
Reconfiguration of connected graph partitions via recombination
Reconfiguration of connected graph partitions via recombination
Approximation and parameterized algorithms for balanced connected partition problems
3D geo-graphs: efficient flip verification for the spherical zoning problem
Some properties of minimal arbitrarily partitionable graphs
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
Partitioning the Cartesian product of a sun-like graph and a path
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
Counting connected partitions of graphs
Arbitrarily edge-partitionable graphs
Toughness properties of arbitrarily partitionable graphs
Algorithms for 2-balanced connected k-partition problem in graphs
Algorithms for 2-balanced connected \(k\)-partition problem in graphs
A _3 condition for arbitrarily partitionable graphs
The k-radius of 2-connected graphs
Connected partitions via connected dominating sets
Perfect hierarchical matchings in graphs
Approximation algorithms for connected k-edge partition
Graph decompositions without isolates
Graph factors and factorization: 1985--2003: a survey
Optimal fault-tolerant routings with small routing tables for k-connected graphs
Approximation algorithm for the balanced 2-connected k-partition problem
A linear algorithm for bipartition of biconnected graphs
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
On covering vertices of a graph by trees
Bicolored graph partitioning, or: gerrymandering at its worst
Decomposing trees with large diameter
Some remarks on \(\lambda _{p,q}\)-connectedness
Distributing vertices along a Hamiltonian cycle in Dirac graphs

This page was built for publication:

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