On the public citation graph
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs
0 signed · 51 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.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf00183214openalex-snapshot
Strengthening of a theorem about 3-polytopes
inferredcites →https://doi.org/10.1016/s0304-0208(08)73499-6openalex-snapshot
Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
inferredcites →https://doi.org/10.1515/crll.1989.394.180openalex-snapshot
On the total coloring 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.1002/(sici)1097-0118(199903)30:3<191::aid-jgt4>3.0.co;2-xopenalex-snapshot
Connected subgraphs with small degree sums in 3-connected planar graphs
inferred← citeshttps://doi.org/10.1002/1097-0118(200006)34:2<170::aid-jgt6>3.0.co;2-popenalex-snapshot
Light paths in 4-connected graphs in the plane and other surfaces
inferred← citeshttps://doi.org/10.1002/1097-0118(200103)36:3<131::aid-jgt1001>3.0.co;2-oopenalex-snapshot
On weights of induced paths and cycles in claw-free andK1,r-free graphs
inferred← citeshttps://doi.org/10.1002/jgt.10144openalex-snapshot
Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
inferred← citeshttps://doi.org/10.1002/jgt.21848openalex-snapshot
On the Decay of Crossing Numbers of Sparse Graphs
inferred← citeshttps://doi.org/10.1006/eujc.1999.0341openalex-snapshot
Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds
inferred← citeshttps://doi.org/10.1006/jctb.1999.1918openalex-snapshot
On 3-Connected Plane Graphs without Triangular Faces
inferred← citeshttps://doi.org/10.1007/bf01608528openalex-snapshot
Light paths with an odd number of vertices in large polyhedral maps
inferred← citeshttps://doi.org/10.1007/s00373-007-0747-7openalex-snapshot
On the Existence of Specific Stars in Planar Graphs
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.2003.11.052openalex-snapshot
Heavy paths, light stars, and big melons
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.042openalex-snapshot
Lightness, heaviness and gravity
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.056openalex-snapshot
The structure of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.058openalex-snapshot
Light graphs in families of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.080openalex-snapshot
The 7-cycle C7 is light in the family of planar graphs with minimum degree 5
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.008openalex-snapshot
On large light graphs in families of polyhedral graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.027openalex-snapshot
Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
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/j.ejc.2004.01.013openalex-snapshot
Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.03.004openalex-snapshot
Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00250-8openalex-snapshot
Light subgraphs of multigraphs on compact 2-dimensional manifolds
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00330-2openalex-snapshot
On light graphs in the family of 4-connected planar graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00368-5openalex-snapshot
On vertex-degree restricted subgraphs in polyhedral graphs
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/s0012-365x(98)00254-4openalex-snapshot
On light cycles in plane triangulations
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00052-7openalex-snapshot
Note on weights of paths in polyhedral graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00072-8openalex-snapshot
Subgraphs of graphs on surfaces with high representativity
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00083-6openalex-snapshot
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree
inferred← citeshttps://doi.org/10.1023/a:1022837727747openalex-snapshot
Light paths with an odd number of vertices in polyhedral maps
inferred← citeshttps://doi.org/10.1090/s0002-9947-02-03004-0openalex-snapshot
Light structures in infinite planar graphs without the strong isoperimetric property
inferred← citeshttps://doi.org/10.1137/05062189xopenalex-snapshot
A Theorem About a Contractible and Light Edge
inferred← citeshttps://doi.org/10.26493/1855-3974.131.91copenalex-snapshot
On local properties of 1-planar graphs with high minimum degree
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.1035openalex-snapshot
On light subgraphs in plane graphs of minimum degree five
inferred← citeshttps://doi.org/10.7151/dmgt.1117openalex-snapshot
Note on the weight of paths in plane triangulations of minimum degree 4 and 5
inferred← citeshttps://doi.org/10.7151/dmgt.1216openalex-snapshot
Light classes of generalized stars in polyhedral maps on surfaces
inferred← citeshttps://doi.org/10.7151/dmgt.1239openalex-snapshot
On the structure of plane graphs of minimum face size 5
inferred← citeshttps://doi.org/10.7151/dmgt.1396openalex-snapshot
Paths of low weight in planar graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1639openalex-snapshot
On properties of maximal 1-planar graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1674openalex-snapshot
On maximum weight of a bipartite graph of given order and size
inferred← citeshttps://doi.org/10.7494/opmath.2019.39.6.829openalex-snapshot
Lightweight paths 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.