On the public citation graph
Covering directed and odd cuts
0 signed · 45 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01226062openalex-snapshot
�ber die Maximalzahl kantendisjunkterA- Wege
inferredcites →https://doi.org/10.1007/bf01902352openalex-snapshot
2-Matchings and 2-covers of hypergraphs
inferredcites →https://doi.org/10.1007/bf02579270openalex-snapshot
How to make a digraph strongly connected
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50025-8openalex-snapshot
Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1093/qmath/27.3.339openalex-snapshot
MATROIDS AND SUBMODULAR FUNCTIONS
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.1112/plms/s3-42.1.178openalex-snapshot
On Odd Cuts and Plane Multicommodity Flows
inferredcites →https://doi.org/10.2307/2303897openalex-snapshot
A Theorem on Graphs, with an Application to a Problem of Traffic Control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22498openalex-snapshot
Orientations of graphs avoiding given lists on out‐degrees
inferred← citeshttps://doi.org/10.1006/jctb.1994.1051openalex-snapshot
Two-Trees Optimal T-Join and Integral Packing of T-Cuts
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_15openalex-snapshot
Parity Constrained k-Edge-Connected Orientations
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_9openalex-snapshot
Conflict-Free Graph Orientations with Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_10openalex-snapshot
On the Length of the Chinese Postman Tour in Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_9openalex-snapshot
A Refinement of the Frank-Sebő-Tardos Theorem and Its Applications
inferred← citeshttps://doi.org/10.1007/bf01202790openalex-snapshot
Conservative weightings and ear-decompositions of graphs
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferred← citeshttps://doi.org/10.1007/bf02592020openalex-snapshot
Finding thet-join structure of graphs
inferred← citeshttps://doi.org/10.1007/s00493-009-2411-8openalex-snapshot
A note on parity constrained orientations
inferred← citeshttps://doi.org/10.1007/s00493-024-00109-zopenalex-snapshot
List-Avoiding Orientations
inferred← citeshttps://doi.org/10.1007/s004930200003openalex-snapshot
Graph Orientations with Edge-connection and Parity Constraints
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90246-9openalex-snapshot
A quick proof of Seymour's theorem on t-joins
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90497-hopenalex-snapshot
A generalization of Petersen's theorem
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90469-2openalex-snapshot
An application of submodular flows
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90481-3openalex-snapshot
On orientations and shortest paths
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90032-sopenalex-snapshot
On shortest T-joins and packing T-cuts
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90027-7openalex-snapshot
On T-joins and odd factors
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113634openalex-snapshot
Modulo orientations with bounded out-degrees
inferred← citeshttps://doi.org/10.1016/j.orl.2013.03.009openalex-snapshot
Tree-compositions and orientations
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00318-2openalex-snapshot
On a min–max theorem on bipartite graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80189-1openalex-snapshot
On min-max theorems in matching theory
inferred← citeshttps://doi.org/10.1112/tlm3.70001openalex-snapshot
The Lovász–Cherkassky theorem in infinite graphs
inferred← citeshttps://doi.org/10.1137/s0097539790186704openalex-snapshot
Potentials in Undirected Graphs and Planar Multiflows
inferred← citeshttps://doi.org/10.1137/s0895480199362071openalex-snapshot
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
inferred← citeshttps://doi.org/10.11606/d.45.1999.tde-20210729-205403openalex-snapshot
T-junções, T-cortes e funções conservativas
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
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.