A Reduction Method for Edge-Connectivity in Graphs

Cited In (only showing first 100 items - show all)

Routing in undirected graphs with constant congestion
Recent results on well-balanced orientations
The lattice of cycles of an undirected graph
Paths and edge-connectivity in graphs
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
Network design with edge-connectivity and degree constraints
Packing Steiner trees
A General Framework for Graph Sparsification
Removable edges in cycles of a \(k\)-connected graph
On spanning tree packings of highly edge connected graphs
Even subgraphs of bridgeless graphs and 2-factors of line graphs
Highly edge-connected detachments of graphs and digraphs
A New Approach to Splitting-Off
Decompositions of highly connected graphs into paths of length 3
Short cycle covers of cubic graphs
Packing of Steiner trees and \(S\)-connectors in graphs
On the orientation of graphs and hypergraphs
Edge disjoint Steiner trees in graphs without large bridges
On shredders and vertex connectivity augmentation
Tight approximation algorithm for connectivity augmentation problems
Minimally 4-edge\(^ \#\)-connected graphs
Flows and parity subgraphs of graphs with large odd-edge-connectivity
Packing arborescences in random digraphs
On decomposing a hypergraph into \(k\) connected sub-hypergraphs
Towards tight(er) bounds for the excluded grid theorem
Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
Spanning even subgraphs of 3‐edge‐connected graphs
Connectivity augmentation in plane straight line graphs
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
Packing Steiner trees on four terminals
2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs
Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Edge-splittings preserving local edge-connectivity of graphs
Decomposing highly edge-connected graphs into paths of any given length
Paths in graphs, reducing the edge-connectivity only by two
Decomposing a graph into bistars
Independent trees in graphs
Shortest coverings of graphs with cycles
Eulerian detachments with local edge-connectivity
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Graph connectivity and its augmentation: Applications of MA orderings
Circular flows of nearly Eulerian graphs and vertex-splitting
Strongly 2-connected orientations of graphs
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
Edge-decompositions of highly connected graphs into paths
Edge-connectivity augmentation of graphs over symmetric parity families
3-flows with large support
Edge-connectivity augmentation problems
2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Edge-Connectivity Augmentations of Graphs and Hypergraphs
On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
Paths and edge-connectivity in graphs. III: Six-terminal k paths
Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
Augmenting the edge connectivity of planar straight line graphs to three
Connectivity augmentation in planar straight line graphs
Decomposing highly connected graphs into paths of length five
On a theorem of Mader
Orientations of infinite graphs with prescribed edge-connectivity
Certifying 3-edge-connectivity
Two paths joining given vertices in \(2k\)-edge-connected graphs
Edge-partitioning 3-edge-connected graphs into paths
Every 4k-edge-connected graph is weakly 3k-linked
Minimizing a monotone concave function with laminar covering constraints
Packing Arborescences in Random Digraphs
Some Theorems on Detachments Preserving Local-Edge-Connectivity
Decomposing graphs into paths of fixed length
Signed Graphs: From Modulo Flows to Integer-Valued Flows
Removable edges in a spanning tree of a \(k\)-connected graph
Splitting and contractible edges in 4-connected graphs
A new contraction technique with applications to congruency-constrained cuts
Edge-orders
On Element-Connectivity Preserving Graph Simplification
Collapsible subgraphs of a 4-edge-connected graph
On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
Factorizing regular graphs
Counterexamples to Jaeger's circular flow conjecture
Splitting off edges between two subsets preserving the edge-connectivity of the graph.
The maximum average connectivity among all orientations of a graph
Integer Flows and Modulo Orientations of Signed Graphs
Graphs of scramble number two
On integer network synthesis problem with tree-metric cost
Edge-disjoint Steiner trees and connectors in graphs
A unifying approach to splitting-off
Four Edge-Independent Spanning Trees
A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Monochromatic \(k\)-edge-connection colorings of graphs
Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
On minimally 2-\(T\)-connected directed graphs
An algorithm for an Eulerian trail traversing specified edges in given order
The Nash-Williams orientation theorem for graphs with countably many ends
The parameterized complexity of the survivable network design problem
An improved approximation guarantee for prize-collecting TSP
A simple certifying algorithm for 3-edge-connectivity
Towards Nash-Williams orientation conjecture for infinite graphs
Edge-connectivity augmentation of simple graphs
Flow extensions and group connectivity with applications

This page was built for publication: A Reduction Method for Edge-Connectivity in Graphs

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