On the public citation graph

A homology theory for spanning tress of a graph

https://doi.org/10.1007/bf01896190
0 signed · 118 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1097-0118(200006)34:2<163::aid-jgt5>3.0.co;2-kopenalex-snapshot
Partitions of a graph into paths with prescribed endvertices and lengths
inferred← citeshttps://doi.org/10.1002/1097-0118(200104)36:4<175::aid-jgt1005>3.0.co;2-topenalex-snapshot
On packing 3-vertex paths in a graph
inferred← citeshttps://doi.org/10.1002/jgt.20437openalex-snapshot
An asymptotic version of a conjecture by Enomoto and Ota
inferred← citeshttps://doi.org/10.1002/jgt.23127openalex-snapshot
Counting connected partitions of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090416openalex-snapshot
On partitioning the edges of graphs into connected subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190180109openalex-snapshot
On the sum of all distances in chromatic blocks
inferred← citeshttps://doi.org/10.1002/net.20243openalex-snapshot
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
inferred← citeshttps://doi.org/10.1006/aama.2000.0710openalex-snapshot
Foundations of a Connectivity Theory for Simplicial Complexes
inferred← citeshttps://doi.org/10.1006/eujc.2002.0576openalex-snapshot
Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1994.1022openalex-snapshot
Contractile Triples in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1998.1895openalex-snapshot
The Connectivities of Leaf Graphs of 2-Connected Graphs
inferred← citeshttps://doi.org/10.1007/10692760_26openalex-snapshot
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_43openalex-snapshot
Bisecting Two Subsets in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_47openalex-snapshot
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_58openalex-snapshot
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_58openalex-snapshot
A linear-time algorithm for four-partitioning four-connected planar graphs
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_2openalex-snapshot
Linear representation of matroids
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_12openalex-snapshot
A Survey on Spanning Tree Congestion
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_11openalex-snapshot
Cut and Flow Formulations for the Balanced Connected k-Partition Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_4openalex-snapshot
Reconfiguration of Connected Graph Partitions via Recombination
inferred← citeshttps://doi.org/10.1007/978-3-030-95018-7_17openalex-snapshot
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_11openalex-snapshot
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_38openalex-snapshot
Approximation Algorithm for the Balanced 2-Connected Bipartition Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_10openalex-snapshot
Some Research Topics
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_3openalex-snapshot
Evacuation of Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-24983-9_19openalex-snapshot
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_4openalex-snapshot
Capacity-Constrained Network-Voronoi Diagram: A Summary of Results
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_45openalex-snapshot
Algorithms for 2-Balanced Connected k-Partition Problem in Graphs
inferred← citeshttps://doi.org/10.1007/bf01669670openalex-snapshot
A solution of Chartrand's problem on spanning trees
inferred← citeshttps://doi.org/10.1007/bf02579332openalex-snapshot
Partition conditions and vertex-connectivity of graphs
inferred← citeshttps://doi.org/10.1007/bf02939489openalex-snapshot
AnO(k 2n2) algorithm to find ak-partition in ak-connected graph
inferred← citeshttps://doi.org/10.1007/bfb0121049openalex-snapshot
Basis graphs of greedoids and two-connectivity
inferred← citeshttps://doi.org/10.1007/s00373-011-1077-3openalex-snapshot
Dense Arbitrarily Vertex Decomposable Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1873-5openalex-snapshot
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey
inferred← citeshttps://doi.org/10.1007/s00446-006-0154-yopenalex-snapshot
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
inferred← citeshttps://doi.org/10.1007/s10107-025-02321-1openalex-snapshot
On the connected (sub)partition polytope
inferred← citeshttps://doi.org/10.1007/s10479-025-06752-zopenalex-snapshot
Optimal sequences for pairwise comparisons: the graph of graphs approach
inferred← citeshttps://doi.org/10.1007/s10878-012-9481-zopenalex-snapshot
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
inferred← citeshttps://doi.org/10.1007/s10878-013-9642-8openalex-snapshot
On the complexity of partitioning a graph into a few connected subgraphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00544-wopenalex-snapshot
Approximation algorithms for the maximally balanced connected graph tripartition problem
inferred← citeshttps://doi.org/10.1007/s10878-023-01058-xopenalex-snapshot
Balanced connected partitions of graphs: approximation, parameterization and lower bounds
inferred← citeshttps://doi.org/10.1007/s10878-025-01332-0openalex-snapshot
Algorithms for 2-balanced connected k-partition problem in graphs
inferred← citeshttps://doi.org/10.1007/s10878-026-01458-9openalex-snapshot
Perfect hierarchical matchings in graphs
inferred← citeshttps://doi.org/10.1007/s10898-012-0028-8openalex-snapshot
Max-min weight balanced connected partition
inferred← citeshttps://doi.org/10.1007/s10958-018-4127-zopenalex-snapshot
Decomposition of a 2-Connected Graph into Three Connected Subgraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90198-xopenalex-snapshot
On k-minimally n-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90122-7openalex-snapshot
Graph decomposition with constraints on the minimum degree
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90189-5openalex-snapshot
A linear algorithm for bipartition of biconnected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90020-0openalex-snapshot
Vertex colorings without isolates
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90010-8openalex-snapshot
Graph decompositions without isolates
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90008-3openalex-snapshot
On the complexity of partitioning graphs into connected subgraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90010-aopenalex-snapshot
Communication in m-connected graphs
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50036-1openalex-snapshot
10.1016/b978-044488002-4/50036-1
inferred← citeshttps://doi.org/10.1016/j.amc.2018.03.015openalex-snapshot
Partitioning the Cartesian product of a tree and a cycle
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.004openalex-snapshot
3D geo-graphs: Efficient flip verification for the spherical zoning problem
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.033openalex-snapshot
Arbitrarily edge-partitionable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.046openalex-snapshot
Toughness properties of arbitrarily partitionable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.023openalex-snapshot
Approximation algorithms for Connected k-Edge Partition
inferred← citeshttps://doi.org/10.1016/j.disc.2004.03.016openalex-snapshot
Perspectives on A-homotopy theory and its applications
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.011openalex-snapshot
Upper bounds for the forwarding indices of communication networks
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.059openalex-snapshot
Graph factors and factorization: 1985–2003: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.035openalex-snapshot
Maximally edge-connected and vertex-connected graphs and digraphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.036openalex-snapshot
On covering vertices of a graph by trees
inferred← citeshttps://doi.org/10.1016/j.disc.2007.10.008openalex-snapshot
Some remarks on λp,q -connectedness
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.066openalex-snapshot
An Ore-type condition for arbitrarily vertex decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.014openalex-snapshot
On the existence of edge cuts leaving several large components
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.012openalex-snapshot
On the shape of decomposable trees
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.012openalex-snapshot
On spanning tree congestion
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100644openalex-snapshot
Arc-routing for winter road maintenance
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.12.059openalex-snapshot
Partitioning a graph into balanced connected classes: Formulations, separation and experiments
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.097openalex-snapshot
An Ore-type condition for arbitrarily vertex decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.06.010openalex-snapshot
On minimal arbitrarily partitionable graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106194openalex-snapshot
A diameter-revealing proof of the Bondy-Lovász lemma
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.06.006openalex-snapshot
Biconnectivity, st-numbering and other applications of DFS using O(n) bits
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.032openalex-snapshot
Decomposing trees with large diameter
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.029openalex-snapshot
A plane graph representation of triconnected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.016openalex-snapshot
Partitioning powers of traceable or hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.001openalex-snapshot
Approximation algorithm for the balanced 2-connected k-partition problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.049openalex-snapshot
Reconfiguration of connected graph partitions via recombination
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.007openalex-snapshot
Reconfiguring (non-spanning) arborescences
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00349-1openalex-snapshot
Graph partition into paths containing specified vertices
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00463-0openalex-snapshot
Plane triangulations are 6-partitionable
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00083-5openalex-snapshot
A linear-time algorithm for four-partitioning four-connected planar graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00084-xopenalex-snapshot
Steiner intervals in graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00225-9openalex-snapshot
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
inferred← citeshttps://doi.org/10.1103/physreve.104.064130openalex-snapshot
Empirical sampling of connected graph partitions for redistricting
inferred← citeshttps://doi.org/10.1109/focs.2015.51openalex-snapshot
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem
inferred← citeshttps://doi.org/10.1109/globecom42002.2020.9322538openalex-snapshot
On Virtual Id Assignment in Networks for High Resilience Routing: A Theoretical Framework
inferred← citeshttps://doi.org/10.1109/icece.2006.355633openalex-snapshot
On Resource Bipartitioning Problem
inferred← citeshttps://doi.org/10.1109/icelce.2010.5700745openalex-snapshot
A linear algorithm for resource four-partitioning four-connected planar graphs
inferred← citeshttps://doi.org/10.1109/tkde.2015.2445756openalex-snapshot
Capacity-Constrained Network-Voronoi Diagram
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16432.xopenalex-snapshot
Graph Decomposition with Constraints on Connectivity and Minimum Degree
inferred← citeshttps://doi.org/10.1137/1.9781611974782.126openalex-snapshot
Doubly Balanced Connected Graph Partitioning
inferred← citeshttps://doi.org/10.1137/15m1030030openalex-snapshot
Mondshein Sequences (a.k.a. (2,1)-Orders)
inferred← citeshttps://doi.org/10.1137/20m1338484openalex-snapshot
On the Vanishing of Discrete Singular Cubical Homology for Graphs
inferred← citeshttps://doi.org/10.1142/s1793525319500146openalex-snapshot
Sizes of spaces of triangulations of 4-manifold and balanced presentations of the trivial group
inferred← citeshttps://doi.org/10.1142/s179383091250005xopenalex-snapshot
FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
inferred← citeshttps://doi.org/10.1145/1007352.1007432openalex-snapshot
(Almost) tight bounds and existence theorems for confluent flows
inferred← citeshttps://doi.org/10.1145/1255443.1255444openalex-snapshot
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
inferred← citeshttps://doi.org/10.1145/3381419openalex-snapshot
Doubly Balanced Connected Graph Partitioning
inferred← citeshttps://doi.org/10.1145/571825.571853openalex-snapshot
Searching for a black hole in arbitrary networks
inferred← citeshttps://doi.org/10.1201/b16132-12openalex-snapshot
Structural Graph Theory
inferred← citeshttps://doi.org/10.1201/b16132-20openalex-snapshot
Connectivity
inferred← citeshttps://doi.org/10.1201/b16132-22openalex-snapshot
Chinese Postman Problems
inferred← citeshttps://doi.org/10.1201/b16132-32openalex-snapshot
Factors and Factorization
inferred← citeshttps://doi.org/10.14267/phd.2024038openalex-snapshot
Preference modelling with a graph theoretic approach
inferred← citeshttps://doi.org/10.2969/jmsj/04910161openalex-snapshot
Graph decompositions without isolated vertices II
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.26openalex-snapshot
Balanced Crown Decomposition for Connectivity Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11965openalex-snapshot
R-BBG$_2$: Recursive Bipartition of Bi-connected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2108.10398openalex-snapshot
Approximation and parameterized algorithms to find balanced connected partitions of graphs
inferred← citeshttps://doi.org/10.5753/ctd.2021.15763openalex-snapshot
The Balanced Connected k-Partition Problem: Polyhedra and Algorithms
inferred← citeshttps://doi.org/10.70675/c1380a84z992ez4dccz873az01b268947bbfopenalex-snapshot
Grands réseaux maillés basse énergie : protocoles minimalistes pour la synchronisation, la mesure de distance et le partitionnement
inferred← citeshttps://doi.org/10.7151/dmgt.1640openalex-snapshot
Rainbow connection in sparse graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1925openalex-snapshot
Structural properties of recursively partitionable graphs with connectivity 2
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.