On the public citation graph
The Minor Crossing Number of Graphs with an Excluded Minor
0 signed · 71 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/(sici)1097-0118(199601)21:1<51::aid-jgt7>3.0.co;2-lopenalex-snapshot
The crossing number ofK3,n in a surface
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199601)21:1<51::aid-jgt7>3.3.co;2-6openalex-snapshot
The crossing number of K3, n in a surface
inferredcites →https://doi.org/10.1002/1097-0118(200101)36:1<8::aid-jgt2>3.0.co;2-oopenalex-snapshot
Crossing numbers of graph embedding pairs on closed surfaces
inferredcites →https://doi.org/10.1002/1097-0118(200103)36:3<168::aid-jgt1004>3.0.co;2-#openalex-snapshot
Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
inferredcites →https://doi.org/10.1002/jgt.10097openalex-snapshot
Crossing numbers of sequences of graphs II: Planar tiles
inferredcites →https://doi.org/10.1002/jgt.20090openalex-snapshot
An improvement of the crossing number bound
inferredcites →https://doi.org/10.1002/jgt.20470openalex-snapshot
Infinite families of crossing‐critical graphs with prescribed average degree and crossing number
inferredcites →https://doi.org/10.1006/aima.1996.0069openalex-snapshot
The Crossing Number of a Graph on a Compact 2-Manifold
inferredcites →https://doi.org/10.1006/jctb.2000.1978openalex-snapshot
Which Crossing Number Is It Anyway?
inferredcites →https://doi.org/10.1006/jvlc.1998.0093openalex-snapshot
Performance of Layout Algorithms: Comprehension, not Computation
inferredcites →https://doi.org/10.1007/11786986_37openalex-snapshot
Planar Crossing Numbers of Genus g Graphs
inferredcites →https://doi.org/10.1007/3-540-33700-8_28openalex-snapshot
Crossing Number of Toroidal Graphs
inferredcites →https://doi.org/10.1007/3-540-63938-1_67openalex-snapshot
Which aesthetic has the greatest effect on human understanding?
inferredcites →https://doi.org/10.1007/978-3-540-30577-4_8openalex-snapshot
Progress on Crossing Number Problems
inferredcites →https://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferredcites →https://doi.org/10.1007/978-3-540-77537-9_3openalex-snapshot
Crossing Number of Graphs with Rotation Systems
inferredcites →https://doi.org/10.1007/bf01744433openalex-snapshot
New lower bound techniques for VLSI
inferredcites →https://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferredcites →https://doi.org/10.1007/bf02086611openalex-snapshot
Drawings of Graphs on Surfaces with Few Crossings
inferredcites →https://doi.org/10.1007/s00453-009-9343-yopenalex-snapshot
Crossing Numbers of Graphs with Rotation Systems
inferredcites →https://doi.org/10.1007/s004539900039openalex-snapshot
Applications of the Crossing Number
inferredcites →https://doi.org/10.1007/s00454-006-1264-9openalex-snapshot
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs
inferredcites →https://doi.org/10.1016/0022-0000(84)90071-0openalex-snapshot
A framework for solving VLSI graph layout problems
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/j.dam.2005.05.030openalex-snapshot
Monotonicity of the minimum cardinality of an identifying code in the hypercube
inferredcites →https://doi.org/10.1016/j.ejc.2003.07.007openalex-snapshot
Embedding grids in surfaces
inferredcites →https://doi.org/10.1016/j.endm.2007.01.024openalex-snapshot
Graph minors and the crossing number of graphs
inferredcites →https://doi.org/10.1016/j.jctb.2003.05.001openalex-snapshot
Arrangements, circular arrangements and the crossing number of C7×C
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2005.09.009openalex-snapshot
Crossing number is hard for cubic graphs
inferredcites →https://doi.org/10.1016/j.jctb.2006.06.003openalex-snapshot
On the crossing numbers of Cartesian products with paths
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.007openalex-snapshot
Identifying codes in some subgraphs of the square lattice
inferredcites →https://doi.org/10.1016/s0012-365x(01)00113-3openalex-snapshot
Bounds on identifying codes
inferredcites →https://doi.org/10.1016/s0012-365x(03)00317-0openalex-snapshot
A successful concept for measuring non-planarity of graphs: the crossing number
inferredcites →https://doi.org/10.1016/s0095-8956(03)00037-6openalex-snapshot
Crossing-number critical graphs have bounded path-width
inferredcites →https://doi.org/10.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1017/s0963548300001383openalex-snapshot
On Canonical Concurrent Flows, Crossing Number and Graph Expansion
inferredcites →https://doi.org/10.1017/s0963548397003192openalex-snapshot
On the Number of Incidences Between Points and Curves
inferredcites →https://doi.org/10.1080/00029890.1973.11993230openalex-snapshot
Crossing Number Problems
inferredcites →https://doi.org/10.1080/00029890.1997.11990611openalex-snapshot
Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
inferredcites →https://doi.org/10.1090/conm/147/01206openalex-snapshot
Excluding a graph with one crossing
inferredcites →https://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferredcites →https://doi.org/10.1109/jsac.2004.830895openalex-snapshot
Robust Location Detection With Sensor Networks
inferredcites →https://doi.org/10.1137/s0895480104444089openalex-snapshot
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
inferredcites →https://doi.org/10.1142/s0129054106004236openalex-snapshot
PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE
inferredcites →https://doi.org/10.1145/264216.264222openalex-snapshot
An experimental study of the basis for graph drawing algorithms
inferredcites →https://doi.org/10.48550/arxiv.0909.1939openalex-snapshot
Technical details regarding infinite families of crossing-critical graphs with prescribed average degree and crossing number
inferredcites →https://doi.org/10.5555/1384231.1384236openalex-snapshot
The crossing number of CmCn is as conjectured for nm(m+1)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_15openalex-snapshot
Approximating the Crossing Number of Toroidal Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02021-6openalex-snapshot
Largest 2-Regular Subgraphs in 3-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00454-010-9245-4openalex-snapshot
General Lower Bounds for the Minor Crossing Number of Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112197openalex-snapshot
The cubic graphs with finite cyclic vertex connectivity larger than girth
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112531openalex-snapshot
Regular Turán numbers of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.037openalex-snapshot
The crossing number of a projective graph is quadratic in the face–width
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.013openalex-snapshot
Minimum Degree and Graph Minors
inferred← citeshttps://doi.org/10.1145/1377676.1377739openalex-snapshot
Improved upper bounds on the crossing number
inferred← citeshttps://doi.org/10.3390/sym12010002openalex-snapshot
A Structured Table of Graphs with Symmetries and Other Special Properties
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.37236/770openalex-snapshot
The Crossing Number of a Projective Graph is Quadratic in the Face–Width
inferred← citeshttps://doi.org/10.48550/arxiv.1107.3279openalex-snapshot
Probabilistic Methods on Erdos Problems
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.math/0604467openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
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.