On the public citation graph
kreuzungsfreiea,b-Wege in endlichen Graphen
0 signed · 41 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.1002/mana.19600220107openalex-snapshot
In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
inferredcites →https://doi.org/10.1007/bf01350130openalex-snapshot
Existenz gewisser Konfigurationen inn-ges�ttigten Graphen und in Graphen gen�gend gro�er Kantendichte
inferredcites →https://doi.org/10.1007/bf01432512openalex-snapshot
Grad und lokaler Zusammenhang in endlichen Graphen
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1017/s0305004100041669openalex-snapshot
On the structure of k -chromatic graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199901)30:1<51::aid-jgt6>3.0.co;2-7openalex-snapshot
On removable circuits in graphs and matroids
inferred← citeshttps://doi.org/10.1002/jgt.10082openalex-snapshot
On removable cycles through every edge
inferred← citeshttps://doi.org/10.1002/jgt.3190050403openalex-snapshot
Nonseparating cycles in K ‐Connected graphs
inferred← citeshttps://doi.org/10.1002/mana.3210740117openalex-snapshot
Über die Anzahl der 1‐Faktoren in 2‐fach zusammenhängenden Graphen
inferred← citeshttps://doi.org/10.1006/jctb.1997.1775openalex-snapshot
Removable Circuits in Multigraphs
inferred← citeshttps://doi.org/10.1007/bf01432539openalex-snapshot
Ecken mit starken Zusammenhangseigenschaften in endlichen Graphen
inferred← citeshttps://doi.org/10.1007/s00373-024-02874-6openalex-snapshot
Connectivity Preserving Hamiltonian Cycles in k-Connected Dirac Graphs
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.dam.2006.04.008openalex-snapshot
Sparse connectivity certificates via MA orderings in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.012openalex-snapshot
Note on non-separating and removable cycles in highly connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.03.012openalex-snapshot
On removable even circuits in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.095openalex-snapshot
Removing circuits in 3-connected binary matroids
inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.018openalex-snapshot
Extremal infinite graph theory
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.10.002openalex-snapshot
Contractible bonds in graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.11.003openalex-snapshot
A weaker version of Lovász' path removal conjecture
inferred← citeshttps://doi.org/10.1016/j.orl.2004.05.008openalex-snapshot
Sparse certificates and removable cycles in -mixed -connected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00377-1openalex-snapshot
Connected matroids with a small circumference
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00379-9openalex-snapshot
On size, circumference and circuit removal in 3-connected matroids
inferred← citeshttps://doi.org/10.1016/s0095-8956(81)80025-1openalex-snapshot
Non-separating induced cycles in graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80170-2openalex-snapshot
Contractible bonds in Graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511721328.010openalex-snapshot
On the interplay between graphs and matroids
inferred← citeshttps://doi.org/10.1017/s0963548399003934openalex-snapshot
Removable Circuits in Binary Matroids
inferred← citeshttps://doi.org/10.1137/130923646openalex-snapshot
$k$-Blocks: A Connectivity Invariant for Graphs
inferred← citeshttps://doi.org/10.1137/18m1198296openalex-snapshot
A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors
inferred← citeshttps://doi.org/10.1155/2013/164535openalex-snapshot
Removable Cycles Avoiding Two Connected Subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4557openalex-snapshot
$k$-Blocks: a connectivity invariant for graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2066openalex-snapshot
Decomposition of the product of cycles based on degree partition
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.