On the public citation graph
Homomorphism theorems for graphs
0 signed · 90 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/bf01160077openalex-snapshot
�ber eine Erweiterung des kleinen Fermatschen Satzes
inferredcites →https://doi.org/10.1007/bf01360256openalex-snapshot
Bemerkungen zu Hadwigers Vermutung
inferredcites →https://doi.org/10.1007/bf01396547openalex-snapshot
A contraction theorem for abstract graphs
inferredcites →https://doi.org/10.1007/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract 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(199904)30:4<261::aid-jgt2>3.0.co;2-zopenalex-snapshot
An extremal problem for subdivisions ofK?5
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199904)30:4<261::aid-jgt2>3.3.co;2-qopenalex-snapshot
An extremal problem for subdivisions of K5
inferred← citeshttps://doi.org/10.1002/9781118032497.ch6openalex-snapshot
The Conjectures of Hadwiger and Hajós
inferred← citeshttps://doi.org/10.1002/jgt.21625openalex-snapshot
Saturation numbers for families of graph subdivisions
inferred← citeshttps://doi.org/10.1002/jgt.22216openalex-snapshot
Clique minors in double‐critical graphs
inferred← citeshttps://doi.org/10.1002/jgt.22515openalex-snapshot
The extremal function for K9= minors
inferred← citeshttps://doi.org/10.1002/jgt.22788openalex-snapshot
Strong chromatic index and Hadwiger number
inferred← citeshttps://doi.org/10.1002/jgt.23169openalex-snapshot
Finding dense minors using average degree
inferred← citeshttps://doi.org/10.1002/jgt.3190150405openalex-snapshot
Do 3n − 5 edges force a subdivision of K5?
inferred← citeshttps://doi.org/10.1002/jgt.3190170409openalex-snapshot
On minors of graphs with at least 3n −4 edges
inferred← citeshttps://doi.org/10.1002/mana.19670350503openalex-snapshot
Zusammenzüge und Unterteilungen von Graphen
inferred← citeshttps://doi.org/10.1002/mana.19720530113openalex-snapshot
Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
inferred← citeshttps://doi.org/10.1002/mana.19740640109openalex-snapshot
Some Homeomorphism Properties of Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1995.1049openalex-snapshot
An Abstract Generalization of a Map Reduction Theorem of Birkhoff
inferred← citeshttps://doi.org/10.1006/jctb.2000.2013openalex-snapshot
The Extremal Function for Complete Minors
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-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_4openalex-snapshot
Graph homomorphisms: structure and symmetry
inferred← citeshttps://doi.org/10.1007/bf01238666openalex-snapshot
A minimal condition implying a specialK 4-subdivision in a graph
inferred← citeshttps://doi.org/10.1007/bf01351673openalex-snapshot
Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
inferred← citeshttps://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferred← citeshttps://doi.org/10.1007/bf01405094openalex-snapshot
Rigidity and the lower bound theorem 1
inferred← citeshttps://doi.org/10.1007/bf01434966openalex-snapshot
�ber endliche Graphen mit vorgegebenen Homomorphieeigenschaften
inferred← citeshttps://doi.org/10.1007/bf01476588openalex-snapshot
Special subdivisions ofK 4 and 4-chromatic graphs
inferred← citeshttps://doi.org/10.1007/bf02413745openalex-snapshot
Omomorfismi fra grafi e grafi moltiplicativi
inferred← citeshttps://doi.org/10.1007/bfb0015449openalex-snapshot
NC algorithms for partitioning sparse graphs into induced forests with an application
inferred← citeshttps://doi.org/10.1007/s000260300006openalex-snapshot
Disjoint Paths in Graphs I,¶3-planar Graphs and Basic Obstructions
inferred← citeshttps://doi.org/10.1007/s40314-026-03717-1openalex-snapshot
Maximum spread of $$K_r-E(\cup _{i=1}^{\ell } P_{k_i})$$-minor-free graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90084-8openalex-snapshot
Simplicial decompositions of graphs: a survey of applications
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90205-7openalex-snapshot
Hadwiger's conjecture (k = 6) : Neighbour configurations of 6-vertices in contraction- critical graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50007-5openalex-snapshot
10.1016/b978-044488002-4/50007-5
inferred← citeshttps://doi.org/10.1016/j.aam.2023.102489openalex-snapshot
Phase transition of degeneracy in minor-closed families
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.064openalex-snapshot
Graphs without minor complete subgraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.031openalex-snapshot
New exact values of the maximum size of graphs free of topological complete subgraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103875openalex-snapshot
The spectral radius of minor-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.07.008openalex-snapshot
The extremal function for K9 minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.04.005openalex-snapshot
The extremal function for disconnected minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.001openalex-snapshot
Coloring graphs with forbidden minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.02.001openalex-snapshot
The extremal function for Petersen minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.12.002openalex-snapshot
The Kelmans-Seymour conjecture IV: A proof
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.007openalex-snapshot
Asymptotic density of graphs excluding disconnected minors
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00206-3openalex-snapshot
Dirac's conjecture on K5-subdivisions
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81803-1openalex-snapshot
Tournaments as strong subcontractions
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70305-4openalex-snapshot
Hadwiger's Conjecture (k = 6): Neighbour Configurations of 6-Vertices in Contraction-Critical Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70454-0openalex-snapshot
On Some Aspects of my Work with Gabriel Dirac
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70464-3openalex-snapshot
The Existence Problem for Graph Homomorphisms
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70468-0openalex-snapshot
Contractions to Complete Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73267-5openalex-snapshot
Homomorphism Interpolation and Approximation
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00361-0openalex-snapshot
STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp)
inferred← citeshttps://doi.org/10.1017/cbo9780511721335.008openalex-snapshot
Recent Excluded Minor Theorems for Graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.008openalex-snapshot
New tools and results in graph minor structure theory
inferred← citeshttps://doi.org/10.1017/s0963548311000174openalex-snapshot
Minors in Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferred← citeshttps://doi.org/10.1112/jlms.70399openalex-snapshot
Extremal number of cliques of given orders in graphs with a forbidden clique minor
inferred← citeshttps://doi.org/10.1137/18m1194973openalex-snapshot
$K_5^-$-Subdivision in 4-Connected Graphs
inferred← citeshttps://doi.org/10.1137/s0895480100378677openalex-snapshot
Extremal Graphs without Topological Complete Subgraphs
inferred← citeshttps://doi.org/10.1137/s0895480197315941openalex-snapshot
The Size of a Graph Without Topological Complete Subgraphs
inferred← citeshttps://doi.org/10.12988/imf.2007.07286openalex-snapshot
Minor extremal problems using Turan graphs
inferred← citeshttps://doi.org/10.19086/aic.2022.5openalex-snapshot
Extremal functions for sparse minors
inferred← citeshttps://doi.org/10.20429/tag.2024.000105openalex-snapshot
A Survey of Maximal k-Degenerate Graphs and k-Trees
inferred← citeshttps://doi.org/10.37236/2268openalex-snapshot
Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph
inferred← citeshttps://doi.org/10.37236/5715openalex-snapshot
Cliques in Graphs Excluding a Complete Graph Minor
inferred← citeshttps://doi.org/10.37236/719openalex-snapshot
Disproof of the List Hadwiger Conjecture
inferred← citeshttps://doi.org/10.37236/8847openalex-snapshot
A Lower Bound on the Average Degree Forcing a Minor
inferred← citeshttps://doi.org/10.37236/9286openalex-snapshot
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2023.13openalex-snapshot
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.02727openalex-snapshot
Islands in minor-closed classes. I. Bounded treewidth and separators
inferred← citeshttps://doi.org/10.48550/arxiv.2106.12099openalex-snapshot
Structural properties of bipartite subgraphs
inferred← citeshttps://doi.org/10.7146/math.scand.a-12004openalex-snapshot
On a certain homomorphism properties of graphs II.
inferred← citeshttps://doi.org/10.7151/dmgt.1637openalex-snapshot
Structural results on maximal k-degenerate graphs
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.