On the public citation graph

Strengthening of a theorem about 3-polytopes

https://doi.org/10.1007/bf00183214
0 signed · 19 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferredcites →https://doi.org/10.21236/ad0768893openalex-snapshot
New Views on Some Old Questions of Combinatorial Geometry

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-642-46908-4_16openalex-snapshot
Computing Light Edges in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-94-007-0221-9_4openalex-snapshot
Local Combinatorial Characterization of Fullerenes
inferred← citeshttps://doi.org/10.1007/bf02757130openalex-snapshot
Polytopes of constant weight
inferred← citeshttps://doi.org/10.1007/bf02804013openalex-snapshot
Extending Kotzig’s theorem
inferred← citeshttps://doi.org/10.1007/bf03353001openalex-snapshot
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00283-020-09993-xopenalex-snapshot
The Impact of Emigration on Slovak Mathematics: The Case of the Bratislava Graph Theory Seminar
inferred← citeshttps://doi.org/10.1007/s004930100001openalex-snapshot
On a Max-min Problem Concerning Weights of Edges
inferred← citeshttps://doi.org/10.1016/j.disc.2012.04.025openalex-snapshot
Weights of induced subgraphs in K1,r -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.007openalex-snapshot
Light subgraphs of graphs embedded in the plane—A survey
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00095-8openalex-snapshot
Subgraphs with restricted degrees of their vertices in planar graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70602-2openalex-snapshot
Structural Properties and Colorings of Plane Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73499-6openalex-snapshot
Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73510-2openalex-snapshot
Non-Hamiltonian Simple Planar Graphs
inferred← citeshttps://doi.org/10.1023/a:1022411100562openalex-snapshot
Paths with restricted degrees of their vertices in planar graphs
inferred← citeshttps://doi.org/10.33542/ppf-0186-5openalex-snapshot
Profesori Prírodovedeckej fakulty UPJŠ v Košiciach 1963 – 2023
inferred← citeshttps://doi.org/10.7151/dmgt.1024openalex-snapshot
An inequality concerning edges of minor weight in convex 3-polytopes
inferred← citeshttps://doi.org/10.7151/dmgt.1674openalex-snapshot
On maximum weight of a bipartite graph of given order and size
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.