On the public citation graph

Contractible edges in triangle-free graphs

https://doi.org/10.1007/bf02579387
0 signed · 36 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190050403openalex-snapshot
Nonseparating cycles in K ‐Connected graphs
inferredcites →https://doi.org/10.1007/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1016/0095-8956(80)90083-0openalex-snapshot
Planarity and duality of finite and infinite graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90065-7openalex-snapshot
Contractible edges in 3-connected graphs
inferredcites →https://doi.org/10.1016/s0095-8956(81)80025-1openalex-snapshot
Non-separating induced cycles in 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/jgt.20227openalex-snapshot
Contractible subgraphs in k‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.20297openalex-snapshot
Contractible elements in k‐connected graphs not containing some specified graphs
inferred← citeshttps://doi.org/10.1002/jgt.22935openalex-snapshot
Contractible edges in longest cycles
inferred← citeshttps://doi.org/10.1006/jctb.2001.2096openalex-snapshot
Contractible Edges and Triangles in k-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70666-3_2openalex-snapshot
Contractible Edges in a k-Connected Graph
inferred← citeshttps://doi.org/10.1007/bf01275673openalex-snapshot
Contractible edges in non-separating cycles
inferred← citeshttps://doi.org/10.1007/bf01789459openalex-snapshot
Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]
inferred← citeshttps://doi.org/10.1007/bf01864149openalex-snapshot
Removable edges in cyclically 4-edge-connected cubic graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1842-zopenalex-snapshot
Contractible Edges in k-Connected Infinite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02103-5openalex-snapshot
Contractible Edges and Removable Edges in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s10587-012-0055-0openalex-snapshot
Contractible edges in some k-connected graphs
inferred← citeshttps://doi.org/10.1007/s10958-007-0332-xopenalex-snapshot
Cliques in k-connected graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90216-6openalex-snapshot
Generalizations of critical connectivity of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90053-0openalex-snapshot
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90126-kopenalex-snapshot
Distribution of contractible edges in k-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.047openalex-snapshot
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.03.025openalex-snapshot
Contractible edges in minimally k -connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.005openalex-snapshot
Removable edges in a k -connected graph and a construction method for k -connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113321openalex-snapshot
Properly 3-contractible edges in a minimally 3-connected graph
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.08.010openalex-snapshot
A splitter theorem on 3-connected matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.04.003openalex-snapshot
Contractible edges in 3-connected graphs that preserve a minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.03.004openalex-snapshot
A splitter theorem on 3-connected binary matroids and inner fans
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00598-8openalex-snapshot
Some forbidden subgraph conditions for a graph to have a k-contractible edge
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00385-8openalex-snapshot
On contractible and vertically contractible elements in 3-connected matroids and graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00052-6openalex-snapshot
Contractible edges in minimally k-connected graphs
inferred← citeshttps://doi.org/10.1017/s0963548302005497openalex-snapshot
Contractible Elements in Graphs and Matroids
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16390.xopenalex-snapshot
Nonseparating Cycles in Graphs
inferred← citeshttps://doi.org/10.1137/060665956openalex-snapshot
Nonseparating Induced Cycles Consisting of Contractible Edges in k -Connected Graphs
inferred← citeshttps://doi.org/10.1142/s0129626421500146openalex-snapshot
Contractible Edges in 3-Connected Cubic Graphs
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5843openalex-snapshot
Connectivity for Matroids and Graphs.
inferred← citeshttps://doi.org/10.55937/sut/991985541openalex-snapshot
Contractible edges in k-connected graphs containing no K4−
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.