On the public citation graph
Das Geschlecht des vollständigen paaren Graphen
0 signed · 136 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.4064/fm-41-1-137-145openalex-snapshot
On a problem of P. Turan concerning 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/1097-0118(200102)36:2<67::aid-jgt2>3.0.co;2-copenalex-snapshot
On spanning trees and walks of low maximum degree
inferred← citeshttps://doi.org/10.1002/jgt.21783openalex-snapshot
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications
inferred← citeshttps://doi.org/10.1002/jgt.22210openalex-snapshot
Partition functions and a generalized coloring‐flow duality for embedded graphs
inferred← citeshttps://doi.org/10.1002/jgt.23198openalex-snapshot
Face‐simple minimal quadrangulations of surfaces
inferred← citeshttps://doi.org/10.1002/jgt.3190020402openalex-snapshot
The embeddings of a graph—A survey
inferred← citeshttps://doi.org/10.1002/jgt.3190040105openalex-snapshot
Genus of cartesian products of regular bipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190050404openalex-snapshot
Quadrilateral embeddings of bipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190070305openalex-snapshot
Embeddings of bipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190100405openalex-snapshot
Minimal ordered triangulations of surfaces
inferred← citeshttps://doi.org/10.1002/jgt.3190110317openalex-snapshot
The maximum interval number of graphs with given genus
inferred← citeshttps://doi.org/10.1006/jctb.1997.1766openalex-snapshot
The Largest Parity Demigenus of a Simple Graph
inferred← citeshttps://doi.org/10.1006/jctb.1998.1836openalex-snapshot
On 2-Connected Spanning Subgraphs with Low Maximum Degree
inferred← citeshttps://doi.org/10.1006/jctb.1999.1909openalex-snapshot
Random Cayley Maps for Groups Generated by Involutions
inferred← citeshttps://doi.org/10.1007/978-3-030-90048-9_7openalex-snapshot
Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number – A Survey
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_11openalex-snapshot
A Simple Quadratic Kernel for Token Jumping on Surfaces
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-642-46908-4openalex-snapshot
Topics in combinatorics and graph theory : essays in honour of Gerhard Ringel
inferred← citeshttps://doi.org/10.1007/bf01772941openalex-snapshot
The splitting number of complete bipartite graphs
inferred← citeshttps://doi.org/10.1007/bf01894629openalex-snapshot
Groups of graphs on given surfaces
inferred← citeshttps://doi.org/10.1007/bf02018409openalex-snapshot
Some results in topological graph theory
inferred← citeshttps://doi.org/10.1007/bf02567322openalex-snapshot
Das Geschlecht des vollständigen dreifärbbaren Graphen
inferred← citeshttps://doi.org/10.1007/bf02925564openalex-snapshot
Sulla tracciabilita' di grafi finiti su superficie compatte
inferred← citeshttps://doi.org/10.1007/bfb0059441openalex-snapshot
On the genus of products of graphs
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1007/s00373-008-0838-0openalex-snapshot
Bounding the Size of Equimatchable Graphs of Fixed Genus
inferred← citeshttps://doi.org/10.1007/s00373-012-1227-2openalex-snapshot
On the Number of Genus Embeddings of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02048-9openalex-snapshot
The (n, k)-Extendable Graphs in Surfaces
inferred← citeshttps://doi.org/10.1007/s00373-021-02394-7openalex-snapshot
Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of $$K_{p,q}$$
inferred← citeshttps://doi.org/10.1007/s00373-022-02488-wopenalex-snapshot
Embedding Grid Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/s00373-023-02698-wopenalex-snapshot
Settling the Nonorientable Genus of the Nearly Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00745-zopenalex-snapshot
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
inferred← citeshttps://doi.org/10.1007/s00454-017-9922-7openalex-snapshot
The Genus of Curve, Pants and Flip Graphs
inferred← citeshttps://doi.org/10.1007/s00454-022-00412-wopenalex-snapshot
The $$\mathbb {Z}_2$$-Genus of Kuratowski Minors
inferred← citeshttps://doi.org/10.1007/s00454-026-00833-xopenalex-snapshot
Faces in Girth-Saturated Graphs on Surfaces
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/s10801-025-01398-3openalex-snapshot
Finite Abelian groups with toroidal subgroup lattices
inferred← citeshttps://doi.org/10.1007/s10878-025-01266-7openalex-snapshot
The minimum orientable genus of the repeated Cartesian product of graphs
inferred← citeshttps://doi.org/10.1007/s10878-026-01416-5openalex-snapshot
On the Genus of Cartesian products of complete graph $$K_{12t+7}$$ with cycles and paths
inferred← citeshttps://doi.org/10.1007/s11425-009-0078-7openalex-snapshot
The genus of a type of graph
inferred← citeshttps://doi.org/10.1007/s12190-008-0077-9openalex-snapshot
Genus embeddings of a type of graph
inferred← citeshttps://doi.org/10.1007/s40314-021-01518-2openalex-snapshot
Uniformization of hyperelliptic curves as a systematic approach to establishing decision regions of hyperbolic signal sets
inferred← citeshttps://doi.org/10.1007/s41109-025-00772-1openalex-snapshot
The selection of critical set for network attack targets: from the perspective of attacker
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90003-9openalex-snapshot
On the genus and connectivity of Hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90037-4openalex-snapshot
Hamiltonian circuits in some maps on the torus
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90042-xopenalex-snapshot
Genus embeddings for some complete tripartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90017-7openalex-snapshot
On the relationship between the genus and the cardinality of the maximum matchings of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90175-hopenalex-snapshot
Quadrangular embeddings of the complete even k-partite graph
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90328-dopenalex-snapshot
The medial graph and voltage- current duality
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90018-9openalex-snapshot
The genus of the Cartesian product of two graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90014-7openalex-snapshot
Determining AII compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90042-1openalex-snapshot
A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
inferred← citeshttps://doi.org/10.1016/0095-8956(76)90018-6openalex-snapshot
Components of branched coverings of current graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90073-4openalex-snapshot
Orientable and nonorientable genus of the complete bipartite graph
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90074-6openalex-snapshot
Orientable imbedding of line graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90081-9openalex-snapshot
Connectivity, genus, and the number of components in vertex-deleted subgraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90004-9openalex-snapshot
On the genus and thickness of graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(75)90070-9openalex-snapshot
Twofold triple systems and graph imbeddings
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90025-5openalex-snapshot
Local optimization on graphs
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.amc.2018.05.023openalex-snapshot
Bounds for scattering number and rupture degree of graphs with genus
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100918openalex-snapshot
Parameterized complexity of graph isomorphism testing
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.003openalex-snapshot
Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.12.022openalex-snapshot
5-Chromatic even triangulations on the Klein bottle
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.001openalex-snapshot
Restricted matching in graphs of small genus
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.098openalex-snapshot
The orientable genus of some joins of complete graphs with large edgeless graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.029openalex-snapshot
The toroidal crossing number of K4,n
inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.038openalex-snapshot
Exponentially many nonisomorphic genus embeddings of Kn,m
inferred← citeshttps://doi.org/10.1016/j.disc.2016.09.017openalex-snapshot
On the genus of the complete tripartite graph Kn,n,1
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.007openalex-snapshot
The smallest surface that contains all signed graphs on K4,n
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.01.009openalex-snapshot
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.05.003openalex-snapshot
Rank-width and tree-width of H -minor-free graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.01.001openalex-snapshot
Orientable embeddings and orientable cycle double covers of projective-planar graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.014openalex-snapshot
Topological Graph Theory: A Personal Account
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.059openalex-snapshot
Constructing all minimum genus embeddings of
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.10.004openalex-snapshot
The nonorientable genus of complete tripartite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.02.001openalex-snapshot
The nonorientable genus of joins of complete graphs with large edgeless graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.07.006openalex-snapshot
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.02.006openalex-snapshot
Quadrangular embeddings of complete graphs and the Even Map Color Theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.06.003openalex-snapshot
Minimal quadrangulations of surfaces
inferred← citeshttps://doi.org/10.1016/j.topol.2018.06.008openalex-snapshot
Lyapunov graphs for circle valued functions
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81815-8openalex-snapshot
On the genus of joins and compositions of graphs
inferred← citeshttps://doi.org/10.1016/s0021-9800(69)80027-xopenalex-snapshot
The genus of the complete tripartite graph K
inferred← citeshttps://doi.org/10.1016/s0304-0208(01)80007-4openalex-snapshot
Imbedding Problems in Graph Theory
inferred← citeshttps://doi.org/10.1017/9781009036214.006openalex-snapshot
Recent advances on the graph isomorphism problem
inferred← citeshttps://doi.org/10.1023/a:1011954130467openalex-snapshot
4-Quasiperiodic Functions on Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1080/00029890.1971.11992770openalex-snapshot
How is a Graph's Betti Number Related to Its Genus?
inferred← citeshttps://doi.org/10.1080/00029890.2020.1867472openalex-snapshot
A New View of Hypercube Genus
inferred← citeshttps://doi.org/10.1080/00927870701713089openalex-snapshot
Classification of Rings with Genus One Zero-Divisor Graphs
inferred← citeshttps://doi.org/10.1080/03081087.2011.591394openalex-snapshot
Convertible andm-convertible matrices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1970-0281653-3openalex-snapshot
The Genus of Repeated Cartesian Products of Bipartite Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1974-0357188-xopenalex-snapshot
The Genera of Edge Amalgamations of Complete Bigraphs
inferred← citeshttps://doi.org/10.1109/itw.2002.1115448openalex-snapshot
Embedding discrete memoryless channels on compact and minimal surfaces
inferred← citeshttps://doi.org/10.1137/19m1249473openalex-snapshot
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five
inferred← citeshttps://doi.org/10.1137/21m1419556openalex-snapshot
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators
inferred← citeshttps://doi.org/10.1137/22m1496529openalex-snapshot
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
inferred← citeshttps://doi.org/10.1137/22m1514076openalex-snapshot
Isomorphism Testing Parameterized by Genus and Beyond
inferred← citeshttps://doi.org/10.1137/s0895480103429319openalex-snapshot
Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
inferred← citeshttps://doi.org/10.1142/s0219498813501557openalex-snapshot
ON THE GENUS OF THE INTERSECTION GRAPH OF IDEALS OF A COMMUTATIVE RING
inferred← citeshttps://doi.org/10.1142/s1793830916500087openalex-snapshot
The genus of the balanced hypercube
inferred← citeshttps://doi.org/10.1145/2933575.2934517openalex-snapshot
Order Invariance on Decomposable Structures
inferred← citeshttps://doi.org/10.1145/3527667openalex-snapshot
Hypergraph Isomorphism for Groups with Restricted Composition Factors
inferred← citeshttps://doi.org/10.1145/3687956openalex-snapshot
Surface Reconstruction Using Rotation Systems
inferred← citeshttps://doi.org/10.14264/158725openalex-snapshot
Latin Bitrades And Related Structures
inferred← citeshttps://doi.org/10.1590/s1807-03022012000100008openalex-snapshot
A new approach for data transmission system on topological surfaces
inferred← citeshttps://doi.org/10.2140/pjm.1972.41.275openalex-snapshot
On the genus of the composition of two graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1695.144openalex-snapshot
The orientable genus of the join of a cycle and a complete graph
inferred← citeshttps://doi.org/10.26493/1855-3974.1800.40copenalex-snapshot
New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
inferred← citeshttps://doi.org/10.37236/10263openalex-snapshot
The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces
inferred← citeshttps://doi.org/10.4153/cjm-2017-028-0openalex-snapshot
Edge-Maximal Graphs on Surfaces
inferred← citeshttps://doi.org/10.4153/cmb-1972-035-8openalex-snapshot
The Slimming Number and Genus of Graphs
inferred← citeshttps://doi.org/10.4153/s0008414x19000440openalex-snapshot
The Genus of a Random Bipartite Graph
inferred← citeshttps://doi.org/10.4153/s0008414x21000316openalex-snapshot
Tree densities in sparse graph classes
inferred← citeshttps://doi.org/10.4230/lipics.socg.2019.39openalex-snapshot
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices
inferred← citeshttps://doi.org/10.4236/ojdm.2014.42005openalex-snapshot
New Bounds on Tenacity of Graphs with Small Genus
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3423openalex-snapshot
2-connected equimatchable graphs on surfaces
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.1907.12287openalex-snapshot
Parameterized Valiant's Classes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0604467openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.7151/dmgt.1379openalex-snapshot
A proof of the crossing number of K 3,n in a surface
inferred← citeshttps://doi.org/10.7916/d88s4wxtopenalex-snapshot
Genus Distributions of Graphs Constructed Through Amalgamations
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.