On the public citation graph

Minimal weight of face in plane triangulations without 4-vertices

https://doi.org/10.1007/bf01229428
0 signed · 21 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/bf01139613openalex-snapshot
Solution of problems of kotzig and Gr�nbaum concerning the isolation of cycles in planar graphs
inferredcites →https://doi.org/10.1007/bfb0067376openalex-snapshot
On the cyclic connectivity of planar graphs

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-981-96-4745-3_2openalex-snapshot
Discharging and Structure of Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/bf02316280openalex-snapshot
Weight of faces in plane maps
inferred← citeshttps://doi.org/10.1007/s00373-016-1743-6openalex-snapshot
A Steinberg-Like Approach to Describing Faces in 3-Polytopes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)e0144-7openalex-snapshot
Triangles with restricted degree sum of their boundary vertices in plane graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.08.028openalex-snapshot
Describing 3-faces in normal plane maps with minimum degree 4
inferred← citeshttps://doi.org/10.1016/j.disc.2015.05.018openalex-snapshot
Low edges in 3-polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.018openalex-snapshot
The weight of faces in normal plane maps
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.022openalex-snapshot
Low minor faces in 3-polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2019.02.019openalex-snapshot
An improvement of Lebesgue’s description of edges in 3-polytopes and faces in plane quadrangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.032openalex-snapshot
Describing faces in 3-polytopes with no vertices of degree from 5 to 7
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112964openalex-snapshot
Another tight description of faces in plane triangulations with minimum degree 4
inferred← citeshttps://doi.org/10.1134/s0037446614010030openalex-snapshot
Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
inferred← citeshttps://doi.org/10.1134/s003744661502007xopenalex-snapshot
The vertex-face weight of edges in 3-polytopes
inferred← citeshttps://doi.org/10.1134/s003744661505002xopenalex-snapshot
Heights of minor faces in triangle-free 3-polytopes
inferred← citeshttps://doi.org/10.1134/s0037446617010050openalex-snapshot
The height of faces of 3-polytopes
inferred← citeshttps://doi.org/10.1134/s0037446619030054openalex-snapshot
Low Faces of Restricted Degree in 3-Polytopes
inferred← citeshttps://doi.org/10.1134/s0037446621020026openalex-snapshot
Heights of Minor Faces in 3-Polytopes
inferred← citeshttps://doi.org/10.7151/dmgt.1877openalex-snapshot
On the weight of minor faces in triangle-free polytopes
inferred← citeshttps://doi.org/10.7151/dmgt.2488openalex-snapshot
All tight descriptions of faces in plane triangulations with minimum degree 4
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.