A Reduction Method for Edge-Connectivity in Graphs
From MaRDI portal
Publication:4170751
Cited in
(only showing first 100 items - show all)- Some Theorems on Detachments Preserving Local-Edge-Connectivity
- Recent results on well-balanced orientations
- Decomposing graphs into paths of fixed length
- Routing in undirected graphs with constant congestion
- The lattice of cycles of an undirected graph
- Paths and edge-connectivity in graphs
- Splitting and contractible edges in 4-connected graphs
- Removable edges in a spanning tree of a k-connected graph
- 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 + )-flow conjecture
- Network design with edge-connectivity and degree constraints
- Packing Steiner trees
- A new contraction technique with applications to congruency-constrained cuts
- Edge-orders
- Removable edges in cycles of a \(k\)-connected graph
- On spanning tree packings of highly edge connected graphs
- On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
- Collapsible subgraphs of a 4-edge-connected graph
- Factorizing regular graphs
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- A general framework for graph sparsification
- Four edge-independent spanning trees
- Highly edge-connected detachments of graphs and digraphs
- A New Approach to Splitting-Off
- Decompositions of highly connected graphs into paths of length 3
- Counterexamples to Jaeger's circular flow conjecture
- Packing of Steiner trees and \(S\)-connectors in graphs
- Short cycle covers of cubic graphs
- On the orientation of graphs and hypergraphs
- Splitting off edges between two subsets preserving the edge-connectivity of the graph.
- The maximum average connectivity among all orientations of a graph
- On shredders and vertex connectivity augmentation
- Tight approximation algorithm for connectivity augmentation problems
- Edge disjoint Steiner trees in graphs without large bridges
- Minimally 4-edge\(^ \#\)-connected graphs
- Flows and parity subgraphs of graphs with large odd-edge-connectivity
- Packing arborescences in random digraphs
- Graphs of scramble number two
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Towards tight(er) bounds for the excluded grid theorem
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- Packing arborescences in random digraphs
- On integer network synthesis problem with tree-metric cost
- Edge-disjoint Steiner trees and connectors in graphs
- Spanning even subgraphs of 3‐edge‐connected graphs
- Connectivity augmentation in plane straight line 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
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- A unifying approach to splitting-off
- Decomposing highly edge-connected graphs into paths of any given length
- Edge-splittings preserving local edge-connectivity of graphs
- Decomposing a graph into bistars
- Paths in graphs, reducing the edge-connectivity only by two
- Independent trees in graphs
- Shortest coverings of graphs with cycles
- Signed graphs: from modulo flows to integer-valued flows
- Eulerian detachments with local edge-connectivity
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs
- Integer flows and modulo orientations of signed graphs
- Removable edges in a 5-connected graph and a construction method of 5-connected graphs
- Monochromatic \(k\)-edge-connection colorings of graphs
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Graph connectivity and its augmentation: Applications of MA orderings
- Strongly 2-connected orientations of graphs
- Circular flows of nearly Eulerian graphs and vertex-splitting
- 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
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
- 3-flows with large support
- On minimally 2-T-connected directed graphs
- Edge-connectivity augmentation problems
- An algorithm for an Eulerian trail traversing specified edges in given order
- 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
- The Nash-Williams orientation theorem for graphs with countably many ends
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- The parameterized complexity of the survivable network design problem
- An improved approximation guarantee for prize-collecting TSP
- Paths and edge-connectivity in graphs. III: Six-terminal k paths
- A simple certifying algorithm for 3-edge-connectivity
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
- Augmenting the edge connectivity of planar straight line graphs to three
- Connectivity augmentation in planar straight line graphs
- On element-connectivity preserving graph simplification
- Decomposing highly connected graphs into paths of length five
- On a theorem of Mader
- Edge-connectivity augmentations of~graphs~and~hypergraphs
- Towards Nash-Williams orientation conjecture for infinite graphs
- Edge-connectivity augmentation of simple graphs
- Orientations of infinite graphs with prescribed edge-connectivity
- Two paths joining given vertices in \(2k\)-edge-connected graphs
- Edge-partitioning 3-edge-connected graphs into paths
- Flow extensions and group connectivity with applications
- Every 4k-edge-connected graph is weakly 3k-linked
- Complementary graphs with flows less than three
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)
