On the public citation graph
Highly linked graphs
0 signed · 131 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.19720530113openalex-snapshot
Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/bf01275674openalex-snapshot
Highly connected non-2-linked digraphs
inferredcites →https://doi.org/10.1007/bf01350174openalex-snapshot
Eine Verallgemeinerung desn-fachen Zusammenhangs f�r Graphen
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1007/bf01787639openalex-snapshot
A sufficient condition for graphs to be weaklyk-linked
inferredcites →https://doi.org/10.1007/bf02993903openalex-snapshot
Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
inferredcites →https://doi.org/10.1016/0012-365x(80)90158-2openalex-snapshot
Disjoint paths in graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90015-7openalex-snapshot
A sufficient condition for a graph to be weakly k-linked
inferredcites →https://doi.org/10.1016/s1385-7258(54)50043-0openalex-snapshot
A Theorem of Kuratowski
inferredcites →https://doi.org/10.1017/s0305004100061521openalex-snapshot
An extremal function for contractions of graphs
inferredcites →https://doi.org/10.1017/s0963548300001140openalex-snapshot
Topological Cliques in Graphs
inferredcites →https://doi.org/10.1017/s096354830000184xopenalex-snapshot
Topological cliques in graphs II
inferredcites →https://doi.org/10.1112/plms/s3-20.1.144openalex-snapshot
On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0118(200010)35:2<69::aid-jgt1>3.3.co;2-9openalex-snapshot
On k‐ordered graphs
inferred← citeshttps://doi.org/10.1002/jgt.10150openalex-snapshot
K‐linked graphs with girth condition
inferred← citeshttps://doi.org/10.1002/jgt.20115openalex-snapshot
An extremal problem for H‐linked graphs
inferred← citeshttps://doi.org/10.1002/jgt.20232openalex-snapshot
Extremal results for rooted minor problems
inferred← citeshttps://doi.org/10.1002/jgt.20301openalex-snapshot
Extremal functions for rooted minors
inferred← citeshttps://doi.org/10.1002/jgt.20362openalex-snapshot
Implications among linkage properties in graphs
inferred← citeshttps://doi.org/10.1002/jgt.20612openalex-snapshot
Linkage for the diamond and the path with four vertices
inferred← citeshttps://doi.org/10.1002/jgt.21845openalex-snapshot
Nonseparating Cycles Avoiding Specific Vertices
inferred← citeshttps://doi.org/10.1002/rsa.21170openalex-snapshot
Cycle lengths in randomly perturbed graphs
inferred← citeshttps://doi.org/10.1002/rsa.21269openalex-snapshot
Immersions of Directed Graphs in Tournaments
inferred← citeshttps://doi.org/10.1006/eujc.1997.0188openalex-snapshot
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
inferred← citeshttps://doi.org/10.1006/eujc.1998.0231openalex-snapshot
Extremal Digraph Results for Topological Complete Subgraphs
inferred← citeshttps://doi.org/10.1006/eujc.2000.0406openalex-snapshot
Subdivisions of Transitive Tournaments
inferred← citeshttps://doi.org/10.1006/jctb.2000.2013openalex-snapshot
The Extremal Function for Complete Minors
inferred← citeshttps://doi.org/10.1006/jctb.2002.2119openalex-snapshot
Ka,k Minors in Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1006/jctb.2002.2133openalex-snapshot
Topological Minors in Graphs of Large Girth
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_17openalex-snapshot
Arrangeability and Clique Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_17openalex-snapshot
Extremal Functions for Graph Minors
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_2openalex-snapshot
The Disjoint Paths Problem: Algorithm and Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_12openalex-snapshot
Algorithms for Finding a Maximum Non-k-linked Graph
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_75openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1007/s003-0018-zopenalex-snapshot
Graph Connectivity After Path Removal
inferred← citeshttps://doi.org/10.1007/s00373-002-0492-xopenalex-snapshot
Advances on the Hamiltonian Problem - A Survey
inferred← citeshttps://doi.org/10.1007/s00373-006-0684-xopenalex-snapshot
Some Recent Progress and Applications in Graph Minor Theory
inferred← citeshttps://doi.org/10.1007/s00373-019-02099-yopenalex-snapshot
On the Maximum Diameter of Path-Pairable Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02970-1openalex-snapshot
A New Connectivity Bound for a Tournament to be Highly Linked
inferred← citeshttps://doi.org/10.1007/s00493-005-0044-0openalex-snapshot
The Extremal Function For Noncomplete Minors
inferred← citeshttps://doi.org/10.1007/s00493-009-2178-yopenalex-snapshot
Highly parity linked graphs
inferred← citeshttps://doi.org/10.1007/s00493-015-3013-2openalex-snapshot
Small complete minors above the extremal edge density
inferred← citeshttps://doi.org/10.1007/s00493-021-4374-3openalex-snapshot
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked
inferred← citeshttps://doi.org/10.1007/s00493-021-4390-3openalex-snapshot
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor
inferred← citeshttps://doi.org/10.1007/s00493-021-4750-zopenalex-snapshot
Oriented Cycles in Digraphs of Large Outdegree
inferred← citeshttps://doi.org/10.1007/s10878-012-9481-zopenalex-snapshot
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
inferred← citeshttps://doi.org/10.1007/s10998-016-0113-8openalex-snapshot
On linkedness in the Cartesian product of graphs
inferred← citeshttps://doi.org/10.1007/s11856-023-2572-yopenalex-snapshot
Immersion of complete digraphs in Eulerian digraphs
inferred← citeshttps://doi.org/10.1016/j.aim.2023.109020openalex-snapshot
Breaking the degeneracy barrier for coloring graphs with no K minor
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124620openalex-snapshot
Characterization of k-subconnected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.007openalex-snapshot
Rooted minor problems in highly connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.018openalex-snapshot
Linkability in iterated line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.05.024openalex-snapshot
On low degree k-ordered graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.038openalex-snapshot
Minimum degree condition for a graph to be knitted
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113319openalex-snapshot
Optimal connectivity for fat-triangle linkages
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113801openalex-snapshot
The linkedness of cubical polytopes: Beyond the cube
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.02.002openalex-snapshot
Forcing unbalanced complete bipartite minors
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.02.013openalex-snapshot
An improved linear edge bound for graph linkages
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103390openalex-snapshot
An improved linear connectivity bound for tournaments to be highly linked
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103874openalex-snapshot
A graph minor condition for graphs to be k -linked
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104022openalex-snapshot
Subdivisions in dicritical digraphs with large order or digirth
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.007openalex-snapshot
A minimum degree condition forcing a digraph to be k-linked
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.08.001openalex-snapshot
Non-zero disjoint cycles in highly connected group labelled graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.04.004openalex-snapshot
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.11.004openalex-snapshot
Linked graphs with restricted lengths
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.11.008openalex-snapshot
The extremal function for 3-linked graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.07.006openalex-snapshot
Linear connectivity forces large complete bipartite minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.02.001openalex-snapshot
Connectivities for k -knitted graphs and for minimal counterexamples to Hadwigerʼs Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.02.009openalex-snapshot
Highly linked tournaments with large minimum out-degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.06.003openalex-snapshot
On 1-factors with prescribed lengths in tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.07.002openalex-snapshot
7-Connected graphs are 4-ordered
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.006openalex-snapshot
Subdivisions of digraphs in tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.03.002openalex-snapshot
Disjoint isomorphic balanced clique subdivisions
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.04.004openalex-snapshot
How to build a pillar: A proof of Thomassen's conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.06.006openalex-snapshot
Linkages and removable paths avoiding vertices
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.10.005openalex-snapshot
Counterexamples to the linkage conjecture for tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.11.001openalex-snapshot
Extremal density for subdivisions with length or sparsity constraints
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00438-7openalex-snapshot
4-connected maximal planar graphs are 4-ordered
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00051-7openalex-snapshot
The extremal function for unbalanced bipartite minors
inferred← citeshttps://doi.org/10.1017/9781009490559.005openalex-snapshot
Sublinear Expanders and Their Applications
inferred← citeshttps://doi.org/10.1017/fms.2025.10120openalex-snapshot
Chi-Boundedness of graphs containing no cycles with k chords
inferred← citeshttps://doi.org/10.1017/s0963548304006169openalex-snapshot
Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth
inferred← citeshttps://doi.org/10.1017/s0963548305007479openalex-snapshot
On Sufficient Degree Conditions for a Graph to be $k$-linked
inferred← citeshttps://doi.org/10.1017/s0963548307008759openalex-snapshot
Linkedness and Ordered Cycles in Digraphs
inferred← citeshttps://doi.org/10.1017/s0963548316000365openalex-snapshot
Local Conditions for Exponentially Many Subdivisions
inferred← citeshttps://doi.org/10.1090/jams/1047openalex-snapshot
Reducing linear Hadwiger’s conjecture to coloring small graphs
inferred← citeshttps://doi.org/10.1112/plms/pdu019openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1137/040617765openalex-snapshot
Improved Bounds for Topological Cliques in Graphs of Large Girth
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch141openalex-snapshot
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
inferred← citeshttps://doi.org/10.1137/110846725openalex-snapshot
Algorithms for Finding a Maximum Non- k -Linked Graph
inferred← citeshttps://doi.org/10.1137/19m130282xopenalex-snapshot
Connectivity for Kite-Linked Graphs
inferred← citeshttps://doi.org/10.1137/25m1807915openalex-snapshot
Recent Progress in Graph Theory Using Expansion
inferred← citeshttps://doi.org/10.1145/1132516.1132576openalex-snapshot
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
inferred← citeshttps://doi.org/10.1145/276698.276867openalex-snapshot
Decision algorithms for unsplittable flow and the half-disjoint paths problem
inferred← citeshttps://doi.org/10.1145/2960410openalex-snapshot
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
inferred← citeshttps://doi.org/10.1145/3798129.3800747openalex-snapshot
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
inferred← citeshttps://doi.org/10.14279/depositonce-2146openalex-snapshot
Incidence Graphs and Unneighborly Polytopes
inferred← citeshttps://doi.org/10.17863/cam.32787openalex-snapshot
Extremal and Structural Problems of Graphs
inferred← citeshttps://doi.org/10.37236/7291openalex-snapshot
On the Maximum Degree of Path-Pairable Planar Graphs
inferred← citeshttps://doi.org/10.37236/9848openalex-snapshot
The Linkedness of Cubical Polytopes: The Cube
inferred← citeshttps://doi.org/10.3934/math.2021340openalex-snapshot
The k-subconnectedness of planar graphs
inferred← citeshttps://doi.org/10.3934/math.2022550openalex-snapshot
The structure of minimally 2-subconnected graphs
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2021.50openalex-snapshot
Exploiting Dense Structures in Parameterized Complexity
inferred← citeshttps://doi.org/10.4310/joc.2011.v2.n1.a4openalex-snapshot
A note on Lovász removable path conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1208.3568openalex-snapshot
Small Complete Minors Above the Extremal Edge Density
inferred← citeshttps://doi.org/10.48550/arxiv.1401.7928openalex-snapshot
On Linkedness of Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5549openalex-snapshot
Linkages in Large Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.48550/arxiv.1802.09230openalex-snapshot
The linkedness of cubical polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1906.09197openalex-snapshot
Fat-triangle linkage and kite-linked graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09378openalex-snapshot
Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor
inferred← citeshttps://doi.org/10.48550/arxiv.1912.02873openalex-snapshot
Connectivity for Kite-Linked Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11798openalex-snapshot
Further progress towards Hadwiger's conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.2104.08470openalex-snapshot
3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs
inferred← citeshttps://doi.org/10.70675/53af4afcz56aaz4876zb235z21f7f302f893openalex-snapshot
Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs
inferred← citeshttps://doi.org/10.70675/905d19e2z819bz470bza148z8b21e3c8ecc3openalex-snapshot
Chaînes alternées dans les graphes arête-coloriés : k-linkage et arbres couvrants
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.