On the public citation graph
Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
0 signed · 128 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/bf01214296openalex-snapshot
�ber die Zerlegung regul�rer Streckenkomplexe ungerader Ordnung
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0063009-7openalex-snapshot
The 1-Factors of Oriented Graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1957-0083725-9openalex-snapshot
Graphs and Subgraphs
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1515/crll.1950.188.228openalex-snapshot
Reguläre Faktoren von Graphen.
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.3190080311openalex-snapshot
A simple proof of Menger's theorem
inferred← citeshttps://doi.org/10.1002/jgt.3190090103openalex-snapshot
Factors and factorizations of graphs—a survey
inferred← citeshttps://doi.org/10.1006/jctb.1996.0002openalex-snapshot
Excluding a Long Double Path Minor
inferred← citeshttps://doi.org/10.1006/jctb.2000.2029openalex-snapshot
A Short Proof of Mader's S-Paths Theorem
inferred← citeshttps://doi.org/10.1007/11917496_4openalex-snapshot
Chordal Deletion Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_54openalex-snapshot
Coverings and delta-coverings
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_4openalex-snapshot
Parameterized Complexity of $$(A,\ell )$$-Path Packing
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_7openalex-snapshot
Faster 2-Disjoint-Shortest-Paths Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_16openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_11openalex-snapshot
Bivariate Complexity Analysis of Almost Forest Deletion
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_7openalex-snapshot
Matroids and Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_43openalex-snapshot
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
inferred← citeshttps://doi.org/10.1007/bf01222754openalex-snapshot
�ber ein graphentheoretisches Problem von T. Gallai
inferred← citeshttps://doi.org/10.1007/bf01226062openalex-snapshot
�ber die Maximalzahl kantendisjunkterA- Wege
inferred← citeshttps://doi.org/10.1007/bf01226465openalex-snapshot
�ber die Maximalzahl kreuzungsfreierH-Wege
inferred← citeshttps://doi.org/10.1007/bf01787420openalex-snapshot
A generalization of menger's theorem for certain block—cactus graphs
inferred← citeshttps://doi.org/10.1007/bf01896839openalex-snapshot
Über ein graphentheoretisches Ergebnis von T. Gallai
inferred← citeshttps://doi.org/10.1007/bf01902503openalex-snapshot
On some connectivity properties of Eulerian graphs
inferred← citeshttps://doi.org/10.1007/bf02020974openalex-snapshot
A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
inferred← citeshttps://doi.org/10.1007/s00224-017-9805-6openalex-snapshot
A Randomized Polynomial Kernel for Subset Feedback Vertex Set
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/s00453-008-9233-8openalex-snapshot
Chordal Deletion is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/s00453-017-0316-2openalex-snapshot
A Polynomial Kernel for Block Graph Deletion
inferred← citeshttps://doi.org/10.1007/s00453-017-0334-0openalex-snapshot
Shortest $$(A+B)$$-Path Packing Via Hafnian
inferred← citeshttps://doi.org/10.1007/s00453-021-00875-yopenalex-snapshot
Parameterized Complexity of $$(A,\ell )$$-Path Packing
inferred← citeshttps://doi.org/10.1007/s00493-007-0056-zopenalex-snapshot
Packing Non-Returning A-Paths*
inferred← citeshttps://doi.org/10.1007/s00493-011-2551-5openalex-snapshot
Packing cycles with modularity constraints
inferred← citeshttps://doi.org/10.1007/s10255-022-1086-4openalex-snapshot
Discussions on Orthogonal Factorizations in Digraphs
inferred← citeshttps://doi.org/10.1007/s11464-009-0011-yopenalex-snapshot
Orthogonal factorizations of digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90066-0openalex-snapshot
Matroid matching and some applications
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90043-5openalex-snapshot
Indestructive deletions of edges from graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90007-8openalex-snapshot
Maximum number of disjoint paths connecting specified terminals in a graph
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/j.aam.2020.102014openalex-snapshot
Disjoint non-balanced A-paths in biased graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.025openalex-snapshot
Recent techniques and results on the Erdős–Pósa property
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.073openalex-snapshot
Packing non-returning A-paths algorithmically
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.015openalex-snapshot
Degree sum conditions for path-factors with specified end vertices in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.01.010openalex-snapshot
Subdigraphs with orthogonal factorizations of digraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.042openalex-snapshot
Subdigraphs with orthogonal factorizations of digraphs (II)
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.05.001openalex-snapshot
A result on r -orthogonal factorizations in digraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103422openalex-snapshot
Packing A -paths of length zero modulo four
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.070openalex-snapshot
Packings and 2-packings of A-paths
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.12.003openalex-snapshot
A generalization of orthogonal factorizations in digraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.02.002openalex-snapshot
Asymptotically optimal Kk -packings of dense graphs via fractional Kk -decompositions
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.03.001openalex-snapshot
Disjoint A-paths in digraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.05.003openalex-snapshot
Packing non-zero A-paths in an undirected model of group labeled graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.11.001openalex-snapshot
The Lovász-Cherkassky theorem in countable graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.12.007openalex-snapshot
Packing A-paths of length zero modulo a prime
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.033openalex-snapshot
A unifying theory of control dependence and its application to arbitrary program structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.021openalex-snapshot
Bivariate complexity analysis of Almost Forest Deletion
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113798openalex-snapshot
Fixed parameterized algorithms for generalized feedback vertex set problems
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00044-7openalex-snapshot
The delta-sum of matching delta-matroids
inferred← citeshttps://doi.org/10.1016/s0021-9800(70)80072-2openalex-snapshot
The achromatic number of a graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70471-0openalex-snapshot
On Disjoint Paths in Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70822-7openalex-snapshot
Graph Theory and Integer Programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00231-0openalex-snapshot
Graph colourings and partitions
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1080/00207160.2014.881993openalex-snapshot
Remarks on orthogonal factorizations of digraphs
inferred← citeshttps://doi.org/10.1080/15427951.2004.10129077openalex-snapshot
Detecting a Network Failure
inferred← citeshttps://doi.org/10.1112/tlm3.70001openalex-snapshot
The Lovász–Cherkassky theorem in infinite graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.83openalex-snapshot
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
inferred← citeshttps://doi.org/10.1137/110843071openalex-snapshot
Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/130949877openalex-snapshot
Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
inferred← citeshttps://doi.org/10.1137/16m1100794openalex-snapshot
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
inferred← citeshttps://doi.org/10.1137/17m1148542openalex-snapshot
Frames, $A$-Paths, and the Erdös--Pósa Property
inferred← citeshttps://doi.org/10.1137/18m1216511openalex-snapshot
$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property
inferred← citeshttps://doi.org/10.1137/18m1226166openalex-snapshot
Packing and Covering Induced Subdivisions
inferred← citeshttps://doi.org/10.1137/21m1421751openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
inferred← citeshttps://doi.org/10.1137/22m1494804openalex-snapshot
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
inferred← citeshttps://doi.org/10.1145/1250790.1250878openalex-snapshot
Some new results on node-capacitated packing of A-paths
inferred← citeshttps://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferred← citeshttps://doi.org/10.1145/2886098openalex-snapshot
Static Backward Slicing of Non-deterministic Programs and Systems
inferred← citeshttps://doi.org/10.3390/a16030144openalex-snapshot
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
inferred← citeshttps://doi.org/10.4153/cjm-1965-035-8openalex-snapshot
On Independent Circuits Contained in a Graph
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2017.5openalex-snapshot
Derandomizing Isolation in Space-Bounded Settings
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2061openalex-snapshot
The graphs with the max-Mader-flow-min-multiway-cut property
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08673openalex-snapshot
Packing A-Paths of Length Zero Modulo Four
inferred← citeshttps://doi.org/10.48550/arxiv.1912.00620openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
inferred← citeshttps://doi.org/10.5555/1496770.1496783openalex-snapshot
A quadratic kernel for feedback vertex set
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of graphs
inferred← citeshttps://doi.org/10.70675/de040967z6217z413dzbf5az3e3b83c3b8d0openalex-snapshot
Subdivisions of digraphs
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.