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