A homology theory for spanning tress of a graph
From MaRDI portal
Publication:4187847
DOI10.1007/BF01896190zbMath0403.05040MaRDI QIDQ4187847
Publication date: 1978
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
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, Upper bounds for the forwarding indices of communication networks, Decomposition of a 2-connected graph into three connected subgraphs, FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS, Homotopy properties of greedoids, Graph decomposition with constraints in the minimum degree, Communication in m-connected graphs, More aspects of arbitrarily partitionable graphs, Graph factors and factorization: 1985--2003: a survey, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, Steiner intervals in graphs, Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases, Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs, Max-min weight balanced connected partition, Dense arbitrarily vertex decomposable graphs, Partitioning powers of traceable or Hamiltonian graphs, On packing 3-vertex paths in a graph, Reconfiguring (non-spanning) arborescences, 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, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, A linear algorithm for bipartition of biconnected graphs, Searching for a black hole in arbitrary networks: optimal mobile agents protocols, Unnamed Item, On minimal arbitrarily partitionable graphs, Unnamed Item, Partition conditions and vertex-connectivity of graphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, 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, Partitions of a graph into paths with prescribed endvertices and lengths, An Ore-type condition for arbitrarily vertex decomposable graphs, Foundations of a connectivity theory for simplicial complexes, Decomposing trees with large diameter, Vertex colorings without isolates, Partitioning a graph into balanced connected classes: formulations, separation and experiments, Some remarks on \(\lambda _{p,q}\)-connectedness, On k-minimally n-edge-connected graphs, Sizes of spaces of triangulations of 4-manifold and balanced presentations of the trivial group, 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, Mondshein Sequences (a.k.a. (2,1)-Orders), Unnamed Item, On the shape of decomposable trees, On spanning tree congestion, Approximation algorithms for the maximally balanced connected graph tripartition problem, Perspectives on \(A\)-homotopy theory and its applications, Partitioning the Cartesian product of a tree and a cycle, Graph decompositions without isolates, On the Vanishing of Discrete Singular Cubical Homology for Graphs, On the complexity of partitioning graphs into connected subgraphs, The connectivities of leaf graphs of 2-connected graphs, A solution of Chartrand's problem on spanning trees, Almost-spanning subgraphs with bounded degree in dense graphs, On the complexity of partitioning a graph into a few connected subgraphs, On the chromatic number of the general Kneser-graph, 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
