On the public citation graph
Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]
0 signed · 47 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/jgt.3190050403openalex-snapshot
Nonseparating cycles in K ‐Connected graphs
inferredcites →https://doi.org/10.1007/bf01222585openalex-snapshot
Eine Eigenschaft der Atome endlicher Graphen
inferredcites →https://doi.org/10.1007/bf02579387openalex-snapshot
Contractible edges in triangle-free graphs
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
inferredcites →https://doi.org/10.1016/s0195-6698(85)80048-2openalex-snapshot
Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1090/s0002-9939-1977-0476580-4openalex-snapshot
A note on 𝑘-critically 𝑛-connected 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.20350openalex-snapshot
A local structure theorem on 5‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.22935openalex-snapshot
Contractible edges in longest cycles
inferred← citeshttps://doi.org/10.1006/jctb.2000.2024openalex-snapshot
A Degree Sum Condition for the Existence of a Contractible Edge in a κ-Connected Graph
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/s00373-004-0591-yopenalex-snapshot
Vertices of Degree 5 in a Contraction Critically 5-connected Graph
inferred← citeshttps://doi.org/10.1007/s00373-005-0621-4openalex-snapshot
Contractible Edges in 7-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-007-0698-zopenalex-snapshot
Reduction for 3-Connected Graphs of Minimum Degree at Least Four
inferred← citeshttps://doi.org/10.1007/s00373-010-0907-zopenalex-snapshot
The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-013-1358-0openalex-snapshot
Contractible Edges in k-Connected Graphs with Some Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1842-zopenalex-snapshot
Contractible Edges in k-Connected Infinite Graphs
inferred← citeshttps://doi.org/10.1007/s10958-011-0615-0openalex-snapshot
Local structure of 7- and 8-connected graphs
inferred← citeshttps://doi.org/10.1007/s10958-012-0887-zopenalex-snapshot
On Local Structure of 9- and 10-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s11766-015-3057-5openalex-snapshot
A result on quasi k-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.08.021openalex-snapshot
Trivially noncontractible edges in a contraction critically 5-connected graph
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.10.041openalex-snapshot
Some properties of contraction-critical 5-connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.052openalex-snapshot
The number of vertices of degree 7 in a contraction-critical 7-connected graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.020openalex-snapshot
A new lower bound on the number of trivially noncontractible edges in contraction critical 5-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.2008.11.004openalex-snapshot
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
inferred← citeshttps://doi.org/10.1016/j.disc.2011.04.032openalex-snapshot
The number of vertices of degree 5 in a contraction-critically 5-connected graph
inferred← citeshttps://doi.org/10.1016/j.disc.2015.07.016openalex-snapshot
Some degree and forbidden subgraph conditions for a graph to have a k -contractible edge
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.015openalex-snapshot
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111598openalex-snapshot
A local condition for k -contractible edges
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112416openalex-snapshot
Contractible edges in k-connected graphs with minimum degree greater than or equal to ⌊3k−12⌋
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.005openalex-snapshot
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.07.006openalex-snapshot
A new degree sum condition for the existence of a contractible edge in a κ -connected graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.11.001openalex-snapshot
Connectivity keeping edges in graphs with large minimum degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.03.002openalex-snapshot
Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.12.001openalex-snapshot
Non-separating subgraphs in highly connected graphs
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(03)00228-0openalex-snapshot
Vertices of degree 6 in a contraction critically 6-connected graph
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80111-8openalex-snapshot
Contractible edges in a k-connected graph (K1 + P4)-free graph
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.