On the public citation graph

A Theorem on Graphs

https://doi.org/10.2307/1968197

0 signed · 188 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 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(199909)32:1<81::aid-jgt8>3.0.co;2-9openalex-snapshot

On certain Hamiltonian cycles in planar graphs

inferred← citeshttps://doi.org/10.1002/9781118032497.ch2openalex-snapshot

Planar Graphs

inferred← citeshttps://doi.org/10.1002/jgt.10051openalex-snapshot

Long cycles in 3‐connected graphs in orientable surfaces

inferred← citeshttps://doi.org/10.1002/jgt.10057openalex-snapshot

Hamilton cycles in plane triangulations

inferred← citeshttps://doi.org/10.1002/jgt.20028openalex-snapshot

Infinite paths in planar graphs I: Graphs with radial nets

inferred← citeshttps://doi.org/10.1002/jgt.20054openalex-snapshot

Infinite paths in planar graphs II, structures and ladder nets

inferred← citeshttps://doi.org/10.1002/jgt.20126openalex-snapshot

Graph relations, clique divergence and surface triangulations

inferred← citeshttps://doi.org/10.1002/jgt.20130openalex-snapshot

Infinite paths in planar graphs III, 1-way infinite paths

inferred← citeshttps://doi.org/10.1002/jgt.20214openalex-snapshot

Simultaneous diagonal flips in plane triangulations

inferred← citeshttps://doi.org/10.1002/jgt.20546openalex-snapshot

The number of defective colorings of graphs on surfaces

inferred← citeshttps://doi.org/10.1002/jgt.21915openalex-snapshot

On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations

inferred← citeshttps://doi.org/10.1002/jgt.22149openalex-snapshot

On the number of hamiltonian cycles in triangulations with few separating triangles

inferred← citeshttps://doi.org/10.1002/jgt.22188openalex-snapshot

One‐way infinite 2‐walks in planar graphs

inferred← citeshttps://doi.org/10.1002/jgt.22228openalex-snapshot

Every graph occurs as an induced subgraph of some hypohamiltonian graph

inferred← citeshttps://doi.org/10.1002/jgt.22407openalex-snapshot

Hamiltonicity of planar graphs with a forbidden minor

inferred← citeshttps://doi.org/10.1002/jgt.22542openalex-snapshot

Long cycles and spanning subgraphs of locally maximal 1‐planar graphs

inferred← citeshttps://doi.org/10.1002/jgt.22864openalex-snapshot

On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs

inferred← citeshttps://doi.org/10.1002/jgt.23250openalex-snapshot

4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected

inferred← citeshttps://doi.org/10.1002/jgt.3190030407openalex-snapshot

On the number of hamiltonian cycles in a maximal planar graph

inferred← citeshttps://doi.org/10.1002/jgt.3190040310openalex-snapshot

An upper bound on the length of a Hamiltonian walk of a maximal planar graph

inferred← citeshttps://doi.org/10.1002/jgt.3190070205openalex-snapshot

A theorem on paths in planar graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190100106openalex-snapshot

Families of graphs complete for the strong perfect graph Conjecture

inferred← citeshttps://doi.org/10.1002/jgt.3190140105openalex-snapshot

Hamiltonian cycles in planar triangulations with no separating triangles

inferred← citeshttps://doi.org/10.1002/jgt.3190200303openalex-snapshot

Hamiltonicity of 5‐Connected Toroidal Triangulations

inferred← citeshttps://doi.org/10.1002/mana.19851240115openalex-snapshot

Über den KURATOWSKIschen Satz für beliebige Flächen

inferred← citeshttps://doi.org/10.1002/rsa.3240070402openalex-snapshot

Largest 4 ‐connected components of 3 ‐connected planar triangulations

inferred← citeshttps://doi.org/10.1006/eujc.1999.0312openalex-snapshot

Signed Diagonal Flips and the Four Color Theorem

inferred← citeshttps://doi.org/10.1006/eujc.2002.0601openalex-snapshot

Flips Signés et Triangulations d’un Polygone

inferred← citeshttps://doi.org/10.1006/jctb.2002.2113openalex-snapshot

Long Cycles in 3-Connected Graphs

inferred← citeshttps://doi.org/10.1007/11533719_88openalex-snapshot

Approximating the Longest Cycle Problem on Graphs with Bounded Degree

inferred← citeshttps://doi.org/10.1007/3-540-10704-5_16openalex-snapshot

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph

inferred← citeshttps://doi.org/10.1007/3-540-47738-1_25openalex-snapshot

Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs

inferred← citeshttps://doi.org/10.1007/978-1-4684-8971-2_2openalex-snapshot

Theory of Finite and Infinite Graphs

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-031-60599-4_21openalex-snapshot

Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs

inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_3openalex-snapshot

A History of Flips in Combinatorial Triangulations

inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_25openalex-snapshot

Kinetic and Stationary Point-Set Embeddability for Plane Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-05105-4_4openalex-snapshot

Constructing Hamiltonian Triangle Strips on Quadrilateral Meshes

inferred← citeshttps://doi.org/10.1007/bf01091741openalex-snapshot

Metamathematical approach to proving theorems of discrete mathematics

inferred← citeshttps://doi.org/10.1007/bf01707988openalex-snapshot

A numerical equivalent of the four color map Problem

inferred← citeshttps://doi.org/10.1007/bf01759038openalex-snapshot

Multilayer grid embeddings for VLSI

inferred← citeshttps://doi.org/10.1007/bf01837870openalex-snapshot

Bridges and Hamiltonian circuits in planar graphs

inferred← citeshttps://doi.org/10.1007/bf02187810openalex-snapshot

Toughness and Delaunay triangulations

inferred← citeshttps://doi.org/10.1007/bf02940780openalex-snapshot

An extension of whitney’s theorem to infinite strong triangulations

inferred← citeshttps://doi.org/10.1007/bf02940781openalex-snapshot

One-way infinite hamiltonian paths in infinite maximal planar graphs

inferred← citeshttps://doi.org/10.1007/bf02986656openalex-snapshot

Spanning eulerian subgraphs of bounded degree in triangulations

inferred← citeshttps://doi.org/10.1007/bf03011392openalex-snapshot

On the tightness conditions for maximal planar graphs

inferred← citeshttps://doi.org/10.1007/bfb0022655openalex-snapshot

Colourings of planar maps and the equality of two languages

inferred← citeshttps://doi.org/10.1007/s00026-013-0204-7openalex-snapshot

Discrete Morse Theory and the Homotopy Type of Clique Graphs

inferred← citeshttps://doi.org/10.1007/s00283-026-10523-4openalex-snapshot

Blanche Descartes and the Existence of Mathematicians

inferred← citeshttps://doi.org/10.1007/s00373-013-1377-xopenalex-snapshot

Recent Advances on the Hamiltonian Problem: Survey III

inferred← citeshttps://doi.org/10.1007/s00373-015-1542-5openalex-snapshot

Criticality of Counterexamples to Toroidal Edge-Hamiltonicity

inferred← citeshttps://doi.org/10.1007/s00373-019-02101-7openalex-snapshot

Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00373-022-02537-4openalex-snapshot

Characterization of (m, n)-Linked Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00373-025-03002-8openalex-snapshot

A Note on the 4-Connected Line Graph of a Planar Triangulation Containing Two CISTs

inferred← citeshttps://doi.org/10.1007/s00453-011-9563-9openalex-snapshot

Fast Minor Testing in Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00453-015-0016-8openalex-snapshot

Two-Page Book Embeddings of 4-Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00453-016-0203-2openalex-snapshot

The Book Thickness of 1-Planar Graphs is Constant

inferred← citeshttps://doi.org/10.1007/s00454-009-9196-9openalex-snapshot

Planar Graphs Have 1-string Representations

inferred← citeshttps://doi.org/10.1007/s00454-021-00355-8openalex-snapshot

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

inferred← citeshttps://doi.org/10.1007/s00493-012-2660-9openalex-snapshot

Perfect matchings in planar cubic graphs

inferred← citeshttps://doi.org/10.1007/s10878-021-00749-7openalex-snapshot

Structure and pancyclicity of maximal planar graphs with diameter two

inferred← citeshttps://doi.org/10.1007/s10958-008-0038-8openalex-snapshot

A method for solving the problem of isometric realization of developments

inferred← citeshttps://doi.org/10.1007/s11083-013-9305-5openalex-snapshot

On a Subposet of the Tamari Lattice

inferred← citeshttps://doi.org/10.1007/s11464-022-1010-5openalex-snapshot

A survey on book-embedding of planar graphs

inferred← citeshttps://doi.org/10.1007/s12044-017-0356-1openalex-snapshot

Hamiltonian cycles in polyhedral maps

inferred← citeshttps://doi.org/10.1007/s41693-023-00096-5openalex-snapshot

Path planning for graded concrete element fabrication

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(78)90047-xopenalex-snapshot

On separating cycles in graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(79)90133-xopenalex-snapshot

Lower bounds on the cardinality of the maximum matchings of planar graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(79)90167-5openalex-snapshot

Interval matroids and graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(93)90180-2openalex-snapshot

On existence theorems

inferred← citeshttps://doi.org/10.1016/0012-365x(94)00177-kopenalex-snapshot

Non-hamiltonian 54-tough maximal planar graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(87)90124-4openalex-snapshot

A non-hamiltonian, nondegenerate delaunay triangulation

inferred← citeshttps://doi.org/10.1016/0020-0190(90)90142-kopenalex-snapshot

Connectivity of plane triangulations

inferred← citeshttps://doi.org/10.1016/0020-0190(94)90125-2openalex-snapshot

Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete

inferred← citeshttps://doi.org/10.1016/0095-8956(74)90061-6openalex-snapshot

Sufficient conditions for a graph to be Hamiltonian

inferred← citeshttps://doi.org/10.1016/0095-8956(76)90051-4openalex-snapshot

Pairs of Hamiltonian circuits in 5-connected planar graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(81)90089-7openalex-snapshot

Planar cubic hypohamiltonian and hypotraceable graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(90)90114-fopenalex-snapshot

Map coloring and the vector cross product

inferred← citeshttps://doi.org/10.1016/0097-3165(73)90012-5openalex-snapshot

Shortness exponents of families of graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(83)90042-2openalex-snapshot

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(84)90109-4openalex-snapshot

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(93)90111-zopenalex-snapshot

On certain Hamiltonian inner triangulations

inferred← citeshttps://doi.org/10.1016/0315-0860(76)90007-0openalex-snapshot

Développements récents de la théorie des graphies

inferred← citeshttps://doi.org/10.1016/0925-7721(92)90018-nopenalex-snapshot

Hamiltonian triangulations and circumscribing polygons of disjoint line segments

inferred← citeshttps://doi.org/10.1016/j.amc.2020.125714openalex-snapshot

Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian

inferred← citeshttps://doi.org/10.1016/j.aml.2006.08.019openalex-snapshot

Extension of a theorem of Whitney

inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.012openalex-snapshot

Making triangulations 4-connected using flips

inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.001openalex-snapshot

Arc diagrams, flip distances, and Hamiltonian triangulations

inferred← citeshttps://doi.org/10.1016/j.dam.2007.03.018openalex-snapshot

Each maximal planar graph with exactly two separating triangles is Hamiltonian

inferred← citeshttps://doi.org/10.1016/j.dam.2015.05.029openalex-snapshot

Domination of maximal K4 -minor free graphs and maximal K2,3 -minor free graphs, and disproofs of two conjectures on planar graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.024openalex-snapshot

On dominating sets of maximal outerplanar and planar graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.048openalex-snapshot

On platypus graphs and the Steiner–Deogun property

inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.059openalex-snapshot

Long cycles in 4-connected planar graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2009.10.005openalex-snapshot

Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2011.11.030openalex-snapshot

Upper bounds on minimum balanced bipartitions

inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.017openalex-snapshot

Iterated clique graphs and bordered compact surfaces

inferred← citeshttps://doi.org/10.1016/j.disc.2018.03.018openalex-snapshot

Non-hamiltonian triangulations with distant separating triangles

inferred← citeshttps://doi.org/10.1016/j.disc.2018.06.015openalex-snapshot

Hamiltonian properties of polyhedra with few 3-cuts—A survey

inferred← citeshttps://doi.org/10.1016/j.disc.2020.112126openalex-snapshot

Hamiltonian cycles in 4-connected plane triangulations with few 4-separators

inferred← citeshttps://doi.org/10.1016/j.disc.2022.112920openalex-snapshot

Index of parameters of iterated line graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2026.114983openalex-snapshot

On non-traceable 3-connected planar cubic graphs of minimum order

inferred← citeshttps://doi.org/10.1016/j.ejc.2003.04.003openalex-snapshot

Cycles in 4-connected planar graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2010.12.001openalex-snapshot

On signed diagonal flip sequences

inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.033openalex-snapshot

2-edge-Hamiltonian-connectedness of 4-connected plane graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103395openalex-snapshot

4-connected polyhedra have at least a linear number of hamiltonian cycles

inferred← citeshttps://doi.org/10.1016/j.ejc.2026.104395openalex-snapshot

A note on cycles in cyclically 4-edge-connected cubic planar graphs

inferred← citeshttps://doi.org/10.1016/j.exmath.2009.04.002openalex-snapshot

Signed permutations and the four color theorem

inferred← citeshttps://doi.org/10.1016/j.jalgebra.2016.09.001openalex-snapshot

On Jones' subgroup of R. Thompson group F

inferred← citeshttps://doi.org/10.1016/j.jctb.2005.01.002openalex-snapshot

Hamilton paths in toroidal graphs

inferred← citeshttps://doi.org/10.1016/j.jctb.2006.02.006openalex-snapshot

The circumference of a graph with no K 3 , t -minor

inferred← citeshttps://doi.org/10.1016/j.jctb.2006.07.002openalex-snapshot

2-Connected spanning subgraphs with low maximum degree in locally planar graphs

inferred← citeshttps://doi.org/10.1016/j.jctb.2008.05.002openalex-snapshot

Hamilton circles in infinite planar graphs

inferred← citeshttps://doi.org/10.1016/j.jctb.2012.07.003openalex-snapshot

The circumference of a graph with no K3,t -minor, II

inferred← citeshttps://doi.org/10.1016/j.jctb.2012.08.004openalex-snapshot

Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices

inferred← citeshttps://doi.org/10.1016/j.jctb.2014.11.006openalex-snapshot

4-connected projective-planar graphs are Hamiltonian-connected

inferred← citeshttps://doi.org/10.1016/j.jctb.2018.05.006openalex-snapshot

Decomposing 4-connected planar triangulations into two trees and one path

inferred← citeshttps://doi.org/10.1016/j.jctb.2022.02.008openalex-snapshot

Counting Hamiltonian cycles in planar triangulations

inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.006openalex-snapshot

Tutte paths and long cycles in circuit graphs

inferred← citeshttps://doi.org/10.1016/j.jctb.2024.10.002openalex-snapshot

Counting cycles in planar triangulations

inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.013openalex-snapshot

Generating simple convex Venn diagrams

inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00089-2openalex-snapshot

On Hamiltonian cycles in 4- and 5-connected plane triangulations

inferred← citeshttps://doi.org/10.1016/s0021-9800(70)80054-0openalex-snapshot

Hamiltonian circuits on 3-polytopes

inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61735-3openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00270-5openalex-snapshot

On the visibility graph of convex translates

inferred← citeshttps://doi.org/10.1016/s0166-8641(03)00182-2openalex-snapshot

Hamiltonian knot projections and lengths of thick knots

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70461-8openalex-snapshot

On a Problem Concerning Longest Circuits in Polyhedral Graphs

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70953-1openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0195-6698(88)80028-3openalex-snapshot

Random Triangulations of the Plane

inferred← citeshttps://doi.org/10.1016/s0377-2217(87)80181-9openalex-snapshot

Facilities layout generalized model solved by n-boundary shortest path heuristics

inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00113-xopenalex-snapshot

The visibility graph of congruent discs is Hamiltonian

inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00003-xopenalex-snapshot

Triangulating with high connectivity

inferred← citeshttps://doi.org/10.1017/s0963548323000135openalex-snapshot

Universal geometric graphs

inferred← citeshttps://doi.org/10.1023/a:1004924423245openalex-snapshot

Simple, Reducible Venn Diagrams on Five Curves and Hamiltonian Cycles

inferred← citeshttps://doi.org/10.1023/a:1016274815398openalex-snapshot

On Some Structural Properties of Fullerene Graphs

inferred← citeshttps://doi.org/10.1023/a:1021998507140openalex-snapshot

Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian

inferred← citeshttps://doi.org/10.1038/s42003-025-08581-zopenalex-snapshot

Automatic phenotyping using exhaustive projection pursuit

inferred← citeshttps://doi.org/10.1051/ro/2022150openalex-snapshot

A note on the double domination number in maximal outerplanar and planar graphs

inferred← citeshttps://doi.org/10.1080/00029890.1972.11992979openalex-snapshot

Thirteen Colorful Variations on Guthrie's Four-Color Conjecture

inferred← citeshttps://doi.org/10.1080/00029890.1978.11994670openalex-snapshot

Dissections and Intertwinings of Graphs

inferred← citeshttps://doi.org/10.1080/00038628.2025.2603534openalex-snapshot

3D topological modeling and multi-agent movement simulation for viral infection risk analysis

inferred← citeshttps://doi.org/10.1088/1748-3190/ab7571openalex-snapshot

Transportation networks inspired by leaf venation algorithms

inferred← citeshttps://doi.org/10.1090/s0002-9947-1946-0018401-4openalex-snapshot

Chromatic Polynomials

inferred← citeshttps://doi.org/10.1090/s0002-9947-1956-0081471-8openalex-snapshot

A Theorem on Planar Graphs

inferred← citeshttps://doi.org/10.1090/s0002-9947-97-01830-8openalex-snapshot

Disjoint paths, planarizing cycles, and spanning walks

inferred← citeshttps://doi.org/10.1090/s0894-0347-1988-0928904-4openalex-snapshot

Rotation distance, triangulations, and hyperbolic geometry

inferred← citeshttps://doi.org/10.1093/comnet/cnz030openalex-snapshot

The structural properties and the spanning trees entropy of the generalized Fractal Scale-Free Lattice

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.001.0001openalex-snapshot

Graph Theory as I Have Known It

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.002.0005openalex-snapshot

Foreword

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.002.0006openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0001openalex-snapshot

Squaring The Square

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0002openalex-snapshot

Knights Errant

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0003openalex-snapshot

Graphs Within Graphs

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0004openalex-snapshot

Unsymmetrical Electricity

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0005openalex-snapshot

Algebra In Graph Theory

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0006openalex-snapshot

Symmetry In Graphs

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0007openalex-snapshot

Graphs On Spheres

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0008openalex-snapshot

The Cats Of Cheshire

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.0009openalex-snapshot

Reconstruction

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.010openalex-snapshot

Planar Enumeration

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.011openalex-snapshot

The Chromatic Eigenvalues

inferred← citeshttps://doi.org/10.1093/oso/9780198502517.003.012openalex-snapshot

In Conclusion

inferred← citeshttps://doi.org/10.1109/12.67327openalex-snapshot

Approximation and intractability results for the maximum cut problem and its variants

inferred← citeshttps://doi.org/10.1111/gean.12220openalex-snapshot

Primal and Dual Access

inferred← citeshttps://doi.org/10.1112/plms.12247openalex-snapshot

A sharp threshold for spanning 2‐spheres in random 2‐complexes

inferred← citeshttps://doi.org/10.1137/0405034openalex-snapshot

Short Encodings of Evolving Structures

inferred← citeshttps://doi.org/10.1137/151002812openalex-snapshot

5-Connected Toroidal Graphs are Hamiltonian-Connected

inferred← citeshttps://doi.org/10.1137/17m1138443openalex-snapshot

Every 4-Connected Graph with Crossing Number 2 is Hamiltonian

inferred← citeshttps://doi.org/10.1137/20m1366551openalex-snapshot

Number of Hamiltonian Cycles in Planar Triangulations

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/s0097539703436473openalex-snapshot

Circumference of Graphs with Bounded Degree

inferred← citeshttps://doi.org/10.1137/s0895480104441450openalex-snapshot

Cycle Extendability of Hamiltonian Interval Graphs

inferred← citeshttps://doi.org/10.1142/s0218196713500276openalex-snapshot

COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA

inferred← citeshttps://doi.org/10.1142/s1793830917500616openalex-snapshot

Winding indexes of Max. and Min. Hamiltonians in N-Gons

inferred← citeshttps://doi.org/10.1145/1060590.1060666openalex-snapshot

Edge partition of planar sraphs into two outerplanar graphs

inferred← citeshttps://doi.org/10.1145/1536414.1536500openalex-snapshot

Every planar graph is the intersection graph of segments in the plane

inferred← citeshttps://doi.org/10.1145/3183368openalex-snapshot

Computing 2-Walks in Polynomial Time

inferred← citeshttps://doi.org/10.1145/3409804openalex-snapshot

Resilience Bounds of Network Clock Synchronization with Fault Correction

inferred← citeshttps://doi.org/10.1215/ijm/1498032030openalex-snapshot

Four color theorem from three points of view

inferred← citeshttps://doi.org/10.1215/ijm/1498032033openalex-snapshot

Tutte relations, TQFT, and planarity of cubic graphs

inferred← citeshttps://doi.org/10.2478/auom-2022-0008openalex-snapshot

Generating punctured surface triangulations with degree at least 4

inferred← citeshttps://doi.org/10.26493/1855-3974.1044.eaaopenalex-snapshot

Improved bounds for hypohamiltonian graphs

inferred← citeshttps://doi.org/10.26493/1855-3974.1733.8c6openalex-snapshot

Types of triangle in Hamiltonian triangulations and an application to domination and k-walks

inferred← citeshttps://doi.org/10.4213/rm9396openalex-snapshot

Алгебраические методы решения многогранников

inferred← citeshttps://doi.org/10.70675/d8460c8eze24bz40a0za732z91edbff20694openalex-snapshot

From planar graphs to higher dimension

inferred← citeshttps://doi.org/10.7151/dmgt.1639openalex-snapshot

On properties of maximal 1-planar graphs

inferred← citeshttps://doi.org/10.7151/dmgt.1872openalex-snapshot

A new proof that 4-connected planar graphs are Hamiltonian-connected

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.