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