On the public citation graph
Homomorphies�tze f�r Graphen
0 signed · 189 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.1002/mana.19670350503openalex-snapshot
Zusammenzüge und Unterteilungen von Graphen
inferredcites →https://doi.org/10.1007/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01351673openalex-snapshot
Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
inferredcites →https://doi.org/10.1007/bf01360256openalex-snapshot
Bemerkungen zu Hadwigers Vermutung
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1112/plms/s3-13.1.193openalex-snapshot
On the Four-Colour Conjecture
inferredcites →https://doi.org/10.1515/crll.1960.204.116openalex-snapshot
Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
inferredcites →https://doi.org/10.1515/crll.1964.214-215.43openalex-snapshot
On the structure of 5- and 6-chromatic abstract graphs.
inferredcites →https://doi.org/10.4153/cmb-1963-019-5openalex-snapshot
Some Results Concerning the Structure of 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/9781118032497.ch6openalex-snapshot
The Conjectures of Hadwiger and Hajós
inferred← citeshttps://doi.org/10.1002/jgt.20232openalex-snapshot
Extremal results for rooted minor problems
inferred← citeshttps://doi.org/10.1002/jgt.20490openalex-snapshot
On vertex partitions and some minor-monotone graph parameters
inferred← citeshttps://doi.org/10.1002/jgt.21637openalex-snapshot
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
inferred← citeshttps://doi.org/10.1002/jgt.21825openalex-snapshot
Circumference and Pathwidth of Highly Connected Graphs
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.22703openalex-snapshot
On the number of edges in maximally linkless graphs
inferred← citeshttps://doi.org/10.1002/jgt.22705openalex-snapshot
Edge‐maximal graphs on orientable and some nonorientable surfaces
inferred← citeshttps://doi.org/10.1002/jgt.22811openalex-snapshot
On the extremal function for graph minors
inferred← citeshttps://doi.org/10.1002/jgt.22937openalex-snapshot
Complete minors and average degree: A short proof
inferred← citeshttps://doi.org/10.1002/jgt.23040openalex-snapshot
A decomposition method on solving the linear arboricity conjecture
inferred← citeshttps://doi.org/10.1002/jgt.23110openalex-snapshot
Local degree conditions for K9 ${K}_{9}$‐minors in graphs
inferred← citeshttps://doi.org/10.1002/jgt.23169openalex-snapshot
Finding dense minors using average degree
inferred← citeshttps://doi.org/10.1002/jgt.3190110210openalex-snapshot
Subcontraction‐equivalence and Hadwiger's conjecture
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.3190150605openalex-snapshot
Vertex‐transitive graphs and vertex‐transitive maps
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/rsa.20447openalex-snapshot
Random graphs containing few disjoint excluded minors
inferred← citeshttps://doi.org/10.1002/rsa.20508openalex-snapshot
Long paths and cycles in random subgraphs of graphs with large minimum degree
inferred← citeshttps://doi.org/10.1002/rsa.21038openalex-snapshot
Clique minors in graphs with a forbidden subgraph
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.1962openalex-snapshot
Surfaces, Tree-Width, Clique-Minors, and Partitions
inferred← citeshttps://doi.org/10.1006/jctb.2000.2013openalex-snapshot
The Extremal Function for Complete Minors
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_40openalex-snapshot
Graph Coloring and the Immersion Order
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_32openalex-snapshot
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_5openalex-snapshot
Extremal Density for Sparse Minors and Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_8openalex-snapshot
Über Unendliche Graphen der Ebene
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_14openalex-snapshot
Progress on the Four-Color Theorem
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-55566-4_29openalex-snapshot
Colorings and Homomorphisms of Minor Closed Classes
inferred← citeshttps://doi.org/10.1007/bf01098279openalex-snapshot
The isomorphism problem for classes of graphs closed under contraction
inferred← citeshttps://doi.org/10.1007/bf01202354openalex-snapshot
Hadwiger's conjecture forK 6-free graphs
inferred← citeshttps://doi.org/10.1007/bf01434966openalex-snapshot
�ber endliche Graphen mit vorgegebenen Homomorphieeigenschaften
inferred← citeshttps://doi.org/10.1007/bf01848093openalex-snapshot
On the edge numbers of graphs with hadwiger number 4 and 5
inferred← citeshttps://doi.org/10.1007/bf02579141openalex-snapshot
Lower bound of the hadwiger number of graphs by their average degree
inferred← citeshttps://doi.org/10.1007/bf02993903openalex-snapshot
Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
inferred← citeshttps://doi.org/10.1007/bfb0069972openalex-snapshot
Le théorème du coloriage des cartes [ex-conjecture de Heawood et conjecture des quatre couleurs]
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-008-0795-7openalex-snapshot
Hadwiger Number and the Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00612-6openalex-snapshot
Local Algorithms for Sparse Spanning Graphs
inferred← citeshttps://doi.org/10.1007/s00454-012-9413-9openalex-snapshot
Linkless and Flat Embeddings in 3-Space
inferred← citeshttps://doi.org/10.1007/s00454-017-9936-1openalex-snapshot
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space
inferred← citeshttps://doi.org/10.1007/s00493-005-0044-0openalex-snapshot
The Extremal Function For Noncomplete Minors
inferred← citeshttps://doi.org/10.1007/s00493-007-2168-xopenalex-snapshot
On embeddability and stresses of graphs
inferred← citeshttps://doi.org/10.1007/s00493-009-2178-yopenalex-snapshot
Highly parity linked graphs
inferred← citeshttps://doi.org/10.1007/s00493-013-2573-2openalex-snapshot
A unified approach to distance-two colouring of graphs on surfaces
inferred← citeshttps://doi.org/10.1007/s00493-014-3010-xopenalex-snapshot
Ramsey numbers of cubes versus cliques
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-018-3733-1openalex-snapshot
Defective Colouring of Graphs Excluding A Subgraph or Minor
inferred← citeshttps://doi.org/10.1007/s00493-019-3856-zopenalex-snapshot
The Extremal Function for Bipartite Linklessly Embeddable Graphs
inferred← citeshttps://doi.org/10.1007/s00493-024-00081-8openalex-snapshot
Defective Coloring is Perfect for Minors
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90280-7openalex-snapshot
On the maximum density of graphs which have no subcontraction to Ks
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90238-xopenalex-snapshot
On a relationship between Hadwiger and stability numbers
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90102-7openalex-snapshot
Forbidden graphs for degree and neighbourhood conditions
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/0012-365x(94)00308-6openalex-snapshot
Zero-sum problems — A survey
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/j.aam.2023.102489openalex-snapshot
Phase transition of degeneracy in minor-closed families
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.022openalex-snapshot
Dynamic coloring of graphs having no K5 minor
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.011openalex-snapshot
A note on odd colorings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.022openalex-snapshot
Dips at small sizes for topological graph obstruction sets
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.023openalex-snapshot
K6-subdivisions in optimal 1-planar graphs
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.06.019openalex-snapshot
On the Hadwiger's conjecture for graph products
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.021openalex-snapshot
Disjoint unions of complete minors
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.010openalex-snapshot
Many disjoint dense subgraphs versus large k -connected subgraphs in large graphs with given edge density
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.009openalex-snapshot
Cliques, minors and apex graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.022openalex-snapshot
K7 -minors in optimal 1 -planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113553openalex-snapshot
Optimal 1-planar multigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113668openalex-snapshot
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114074openalex-snapshot
K7-minors in optimal 1-embedded graphs on the projective plane
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114861openalex-snapshot
The weak version of the graph complement conjecture and partial results for the delta conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.12.017openalex-snapshot
Disjoint Kr-minors in large graphs with given average degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.01.011openalex-snapshot
On the structure of k-connected graphs without Kk-minor
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.07.013openalex-snapshot
Grad and classes with bounded expansion I. Decompositions
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.02.003openalex-snapshot
Small minors in dense graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.10.010openalex-snapshot
Detecting minors in matroids through triangles
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.07.010openalex-snapshot
The extremal functions for triangle-free graphs with excluded minors
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.08.002openalex-snapshot
On the critical densities of minor-closed classes
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103711openalex-snapshot
Properties of 8-contraction-critical graphs with no K7 minor
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.079openalex-snapshot
List Colouring Squares of Planar Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.013openalex-snapshot
Minimum Degree and Graph Minors
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.02.018openalex-snapshot
The Colin de Verdière parameter, excluded minors, and the spectral radius
inferred← citeshttps://doi.org/10.1016/j.jcta.2026.106164openalex-snapshot
Extremal eigenvalues with respect to graph minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.04.006openalex-snapshot
The extremal function for K8- minors
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.2008.03.006openalex-snapshot
On the odd-minor variant of Hadwiger's conjecture
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.2010.09.001openalex-snapshot
The edge-density for K2,t minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.04.004openalex-snapshot
On the number of cliques in graphs with a forbidden minor
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.2018.08.010openalex-snapshot
On the purity of minor-closed classes of graphs
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/j.jctb.2022.07.002openalex-snapshot
Spectral extrema of K,-minor free graphs – On a conjecture of M. Tait
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.08.005openalex-snapshot
Bipartite graphs with no K6 minor
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.08.005openalex-snapshot
Dense minors of graphs with independence number two
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)70374-1openalex-snapshot
A Survey of (m, k)-Colorings
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70468-0openalex-snapshot
Contractions to Complete Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70500-4openalex-snapshot
Simplicial Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73549-7openalex-snapshot
On Hadwiger's Number and the Stability Number
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80140-4openalex-snapshot
K6 and icosahedron minors in 5-connected projective planar graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80190-8openalex-snapshot
Subdivisions, linking, minors, and extremal functions
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.003openalex-snapshot
Recent developments in graph Ramsey theory
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.008openalex-snapshot
New tools and results in graph minor structure theory
inferred← citeshttps://doi.org/10.1017/cbo9781316479988openalex-snapshot
Random Graphs, Geometry and Asymptotic Structure
inferred← citeshttps://doi.org/10.1017/s0305004100061521openalex-snapshot
An extremal function for contractions of graphs
inferred← citeshttps://doi.org/10.1017/s0963548309009717openalex-snapshot
Random Graphs from a Minor-Closed Class
inferred← citeshttps://doi.org/10.1017/s1446788700036569openalex-snapshot
On zero-sum turan problems of Bialostocki and Dierker
inferred← citeshttps://doi.org/10.1090/s0002-9904-1970-12601-5openalex-snapshot
Polytopes, graphs, and complexes
inferred← citeshttps://doi.org/10.1093/imrn/rnab154openalex-snapshot
Extremal density for sparse minors and subdivisions
inferred← citeshttps://doi.org/10.1109/focs.2013.59openalex-snapshot
Strong Backdoors to Bounded Treewidth SAT
inferred← citeshttps://doi.org/10.1109/focs.2017.76openalex-snapshot
Minor-Free Graphs Have Light Spanners
inferred← citeshttps://doi.org/10.1109/focs.2019.00060openalex-snapshot
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
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.1112/jlms/jdu063openalex-snapshot
Logarithmically small minors and topological minors
inferred← citeshttps://doi.org/10.1137/070693540openalex-snapshot
$K_6$-Minors in Triangulations on the Klein Bottle
inferred← citeshttps://doi.org/10.1137/120866725openalex-snapshot
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
inferred← citeshttps://doi.org/10.1137/18m1206126openalex-snapshot
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
inferred← citeshttps://doi.org/10.1137/22m1542854openalex-snapshot
Treewidth, Circle Graphs, and Circular Drawings
inferred← citeshttps://doi.org/10.1137/25m1807915openalex-snapshot
Recent Progress in Graph Theory Using Expansion
inferred← citeshttps://doi.org/10.1142/s0218216522500754openalex-snapshot
The complement problem for linklessly embeddable graphs
inferred← citeshttps://doi.org/10.1145/1159892.1159895openalex-snapshot
Oracles for bounded-length shortest paths in planar graphs
inferred← citeshttps://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
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.2139/ssrn.5362087openalex-snapshot
Extremal Eigenvalues with Respect to Graph Minors
inferred← citeshttps://doi.org/10.2140/agt.2023.23.2545openalex-snapshot
New bounds on maximal linkless graphs
inferred← citeshttps://doi.org/10.2140/agt.2024.24.555openalex-snapshot
Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
inferred← citeshttps://doi.org/10.2140/involve.2020.13.829openalex-snapshot
Simple graphs of order 12 and minimum degree 6 contain K6 minors
inferred← citeshttps://doi.org/10.3390/math14040637openalex-snapshot
The Structure of Graphs Whose Vertices of Degree at Least Three Are at a Distance of at Least Three
inferred← citeshttps://doi.org/10.37236/359openalex-snapshot
Double-Critical Graphs and Complete Minors
inferred← citeshttps://doi.org/10.37236/5321openalex-snapshot
Average Degree Conditions Forcing a Minor
inferred← citeshttps://doi.org/10.37236/567openalex-snapshot
Complete and Almost Complete Minors in Double-Critical $8$-Chromatic Graphs
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.4153/s0008414x21000316openalex-snapshot
Tree densities in sparse graph classes
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.37openalex-snapshot
Linear Transformations Between Dominating Sets in the TAR-Model
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2445openalex-snapshot
Evasiveness and the Distribution of Prime Numbers
inferred← citeshttps://doi.org/10.4310/joc.2011.v2.n3.a7openalex-snapshot
Extremal results regarding $K_6$-minors in graphs of girth at least $5$
inferred← citeshttps://doi.org/10.4310/joc.2011.v2.n4.a6openalex-snapshot
The Erdös-Lovász Tihany conjecture and complete minors
inferred← citeshttps://doi.org/10.46298/dmtcs.589openalex-snapshot
Immersion containment and connectivity in color-critical graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5468openalex-snapshot
On triangles in K_r-minor free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6510openalex-snapshot
A Note on Hadwiger's Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1807.11617openalex-snapshot
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11100openalex-snapshot
Clique minors in graphs with a forbidden subgraph
inferred← citeshttps://doi.org/10.48550/arxiv.2009.13482openalex-snapshot
Densities of minor-closed graph classes are rational
inferred← citeshttps://doi.org/10.48550/arxiv.2012.02159openalex-snapshot
Extremal density for sparse minors and subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2106.12099openalex-snapshot
Structural properties of bipartite subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.00874openalex-snapshot
Homomorphism counts in robustly sparse graphs
inferred← citeshttps://doi.org/10.70675/1d366b25z29b0z4b44zaef4z87e889a6ee49openalex-snapshot
Graph domination and reconfiguration problems
inferred← citeshttps://doi.org/10.70675/81cccf81zb873z4003za275zb21b3505db2eopenalex-snapshot
Reconfiguration problems in 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.