On the public citation graph
On the cyclic connectivity of planar graphs
0 signed · 60 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.1017/s0370164600044229openalex-snapshot
4. On the Colouring of Maps
inferredcites →https://doi.org/10.1090/s0002-9904-1970-12601-5openalex-snapshot
Polytopes, graphs, and complexes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mana.19921580108openalex-snapshot
Structural Properties of Planar Maps with the Minimal Degree 5
inferred← citeshttps://doi.org/10.1002/net.21476openalex-snapshot
Linearly many faults in arrangement graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_21openalex-snapshot
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_18openalex-snapshot
Cyclic Vertex Connectivity of Star Graphs
inferred← citeshttps://doi.org/10.1007/bf01139613openalex-snapshot
Solution of problems of kotzig and Gr�nbaum concerning the isolation of cycles in planar graphs
inferred← citeshttps://doi.org/10.1007/bf01229428openalex-snapshot
Minimal weight of face in plane triangulations without 4-vertices
inferred← citeshttps://doi.org/10.1007/s10114-013-2255-4openalex-snapshot
Super cyclically edge-connected vertex-transitive graphs of girth at least 5
inferred← citeshttps://doi.org/10.1007/s10878-010-9304-zopenalex-snapshot
Super cyclically edge connected transitive graphs
inferred← citeshttps://doi.org/10.1007/s10878-012-9472-0openalex-snapshot
Super-cyclically edge-connected regular graphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9759-4openalex-snapshot
Atoms of cyclic edge connectivity in regular graphs
inferred← citeshttps://doi.org/10.1007/s10878-025-01273-8openalex-snapshot
Link fault tolerability of the Cartesian product power graph $$(K_{9}-C_{9})^{n}$$: conditional edge-connectivities under six link fault patterns
inferred← citeshttps://doi.org/10.1007/s11227-023-05770-7openalex-snapshot
On modified l-embedded edge-connectivity of enhanced hypercubes
inferred← citeshttps://doi.org/10.1007/s40840-015-0286-yopenalex-snapshot
On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs
inferred← citeshttps://doi.org/10.1007/s40840-020-00999-4openalex-snapshot
Some Results About the Reliability of Folded Hypercubes
inferred← citeshttps://doi.org/10.1007/s40995-021-01086-4openalex-snapshot
n-Restricted Edge Connectivity of m-Barrel Fullerene Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90121-8openalex-snapshot
On several sorts of connectivity
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.dam.2022.07.009openalex-snapshot
On the structure of essentially-highly-connected polyhedral graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.043openalex-snapshot
Edge isoperimetric method for link fault tolerance of the complete Josephus cube under five models: A unified approach
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.055openalex-snapshot
Characterization of graphs with infinite cyclic edge connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.019openalex-snapshot
On cyclic edge-connectivity of transitive 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.2013.10.021openalex-snapshot
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
inferred← citeshttps://doi.org/10.1016/j.disc.2013.11.021openalex-snapshot
Describing faces in plane triangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2014.06.024openalex-snapshot
Light C 4 and C 5 in 3-polytopes with minimum degree 5
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.06.032openalex-snapshot
Describing faces in 3-polytopes with no vertices of degree from 5 to 7
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.009openalex-snapshot
Linearly many faults in dual-cube-like networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113855openalex-snapshot
Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70602-2openalex-snapshot
Structural Properties and Colorings of Plane Graphs
inferred← citeshttps://doi.org/10.1063/1.5012673openalex-snapshot
New results about the structure of plane graphs: A survey
inferred← citeshttps://doi.org/10.1080/17445760.2012.735234openalex-snapshot
Linearly many faults in augmented cubes
inferred← citeshttps://doi.org/10.1080/17445760.2021.1952579openalex-snapshot
Cyclic connectivity of the data center network
inferred← citeshttps://doi.org/10.1109/apcip.2009.184openalex-snapshot
An Efficient Algorithm for Cyclic Edge Connectivity of Planar Graphs
inferred← citeshttps://doi.org/10.1109/qrs-c55045.2021.00128openalex-snapshot
A Novel View: Edge is Operimetric Methods and Reliability Evaluation of Several kinds of Conditional Edge-connectivity of Interconnection Networks
inferred← citeshttps://doi.org/10.1109/tc.2014.2304391openalex-snapshot
Symmetric Property and Reliability of Balanced Hypercube
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/s0037446615040059openalex-snapshot
Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
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.1134/s0037446622040061openalex-snapshot
Combinatorial Structure of Faces in Triangulations on Surfaces
inferred← citeshttps://doi.org/10.1142/s0129054111008994openalex-snapshot
LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
inferred← citeshttps://doi.org/10.1142/s012905412350017xopenalex-snapshot
On the Super (Edge)-Connectivity of Generalized Johnson Graphs
inferred← citeshttps://doi.org/10.1142/s0129626424500038openalex-snapshot
Super (Edge-)connectivity of the Folded Petersen Network
inferred← citeshttps://doi.org/10.1142/s0219265921500249openalex-snapshot
Some Properties of the Balanced Hypercube
inferred← citeshttps://doi.org/10.1142/s1793830911001322openalex-snapshot
CYCLIC CONNECTIVITY OF STAR GRAPH
inferred← citeshttps://doi.org/10.1587/transinf.2017edp7334openalex-snapshot
Cyclic Vertex Connectivity of Trivalent Cayley Graphs
inferred← citeshttps://doi.org/10.3390/sym14020304openalex-snapshot
Super Vertex (Edge)-Connectivity of Varietal Hypercube
inferred← citeshttps://doi.org/10.37398/jsr.2021.650906openalex-snapshot
The Cyclic Edge Connectivity Number of an Arithmetic Graph G=Vn
inferred← citeshttps://doi.org/10.4236/am.2013.42053openalex-snapshot
Super Cyclically Edge Connected Half Vertex Transitive Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1877openalex-snapshot
On the weight of minor faces in triangle-free polytopes
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.