scientific article; zbMATH DE number 863470

From MaRDI portal
Publication:4871749

zbMath0846.05055MaRDI QIDQ4871749

András Frank

Publication date: 29 September 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (40)

Increasing digraph arc-connectivity by arc addition, reversal and complementThe monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.Cyclic connectivity, edge-elimination, and the twisted Isaacs graphsChromatic characterization of biclique coversOn constructive characterizations of \((k,l)\)-sparse graphsStrong connectivity of polyhedral complexesOptimal wavelength-routed multicastingMonotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-WilliamsPacking of rigid spanning subgraphs and spanning treesComplexity of (arc)-connectivity problems involving arc-reversals or deorientationsThe complexity of 2-vertex-connected orientation in mixed graphsApproximating directed weighted-degree constrained networksGraph varieties in high dimensionConstructive characterizations for packing and covering with treesUnnamed ItemEulerian orientations and vertex-connectivityApproximating Directed Weighted-Degree Constrained NetworksStrongly 2-connected orientations of graphsA simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithmsThe lattice of cycles of an undirected graphOrientations of graphs with prescribed weighted out-degreesShort disjoint paths in locally connected graphsOn orienting graphs for connectivity: Projective planes and Halin graphsSparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphsOn minimum power connectivity problemsRigidity, global rigidity, and graph decompositionApproximating minimum power covers of intersecting families and directed edge-connectivity problemsWhat is on his mind?Disjoint paths in arborescencesMultiflows in symmetric digraphsSimultaneous well-balanced orientations of graphsExtremal infinite graph theoryOn Frank's conjecture on \(k\)-connected orientationsPartial cubes: Structures, characterizations, and constructionsDisjoint paths in symmetric digraphsOn Eulerian orientations of even-degree hypercubesProblems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphsOn one maximum multiflow problem and related metricsOn the existence of \(k\) edge-disjoint 2-connected spanning subgraphsSubgraphs decomposable into two trees and \(k\)-edge-connected subgraphs




This page was built for publication: