On the public citation graph

Panconnected graphs II

https://doi.org/10.1007/bf02018497

0 signed · 70 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/bf02412090openalex-snapshot

Arc coverings of graphs

inferredcites →https://doi.org/10.1016/0012-365x(72)90079-9openalex-snapshot

A note on Hamiltonian circuits

inferredcites →https://doi.org/10.1016/0012-365x(73)90035-6openalex-snapshot

Theory of path length distributions I

inferredcites →https://doi.org/10.1016/0095-8956(71)90016-5openalex-snapshot

Pancyclic graphs I

inferredcites →https://doi.org/10.1016/0095-8956(72)90020-2openalex-snapshot

On Hamilton's ideals

inferredcites →https://doi.org/10.1016/s0021-9800(70)80037-0openalex-snapshot

A sufficient condition for hamiltonian connectedness

inferredcites →https://doi.org/10.1016/s0924-6509(08)70181-8openalex-snapshot

North-Holland Mathematical Library

inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot

Graphs and Hypergraphs

inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot

Some Theorems on Abstract Graphs

inferredcites →https://doi.org/10.1215/s0012-7094-70-03749-xopenalex-snapshot

n-hamiltonian connected graphs

inferredcites →https://doi.org/10.2307/2308928openalex-snapshot

Note on Hamilton Circuits

inferredcites →https://doi.org/10.2307/3614234openalex-snapshot

On a Problem of Ore

inferredcites →https://doi.org/10.4153/cmb-1972-012-3openalex-snapshot

Variations on the Hamiltonian Theme

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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

An asymptotic version of a conjecture by Enomoto and Ota

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

Distributing vertices on Hamiltonian cycles

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

Connectivity keeping trees in 2‐connected graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_1openalex-snapshot

Highly Irregular

inferred← citeshttps://doi.org/10.1007/978-3-319-89617-5_4openalex-snapshot

Degree Conditions

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

Graph theory (algorithmic, algebraic, and metric problems)

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

Path extendable graphs

inferred← citeshttps://doi.org/10.1007/s00373-005-0619-yopenalex-snapshot

An Anti-Ramsey Theorem on Cycles

inferred← citeshttps://doi.org/10.1007/s00373-010-0911-3openalex-snapshot

Pan-H-Linked Graphs

inferred← citeshttps://doi.org/10.1007/s00373-011-1042-1openalex-snapshot

Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs

inferred← citeshttps://doi.org/10.1007/s00373-013-1325-9openalex-snapshot

Note on Locating Pairs of Vertices on Hamiltonian Cycles

inferred← citeshttps://doi.org/10.1007/s00373-015-1626-2openalex-snapshot

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs

inferred← citeshttps://doi.org/10.1007/s00373-017-1762-yopenalex-snapshot

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle

inferred← citeshttps://doi.org/10.1007/s00373-018-1956-yopenalex-snapshot

Enomoto and Ota’s Conjecture Holds for Large Graphs

inferred← citeshttps://doi.org/10.1007/s00373-020-02190-9openalex-snapshot

On Cycles that Alternate Through Selected Sets of Vertices

inferred← citeshttps://doi.org/10.1007/s11227-009-0356-8openalex-snapshot

Panconnectivity of Cartesian product graphs

inferred← citeshttps://doi.org/10.1007/s11227-015-1417-9openalex-snapshot

2-Disjoint-path-coverable panconnectedness of crossed cubes

inferred← citeshttps://doi.org/10.1007/s11227-018-2295-8openalex-snapshot

The panpositionable panconnectedness of crossed cubes

inferred← citeshttps://doi.org/10.1007/s11425-016-9057-xopenalex-snapshot

Distributing pairs of vertices on Hamiltonian cycles

inferred← citeshttps://doi.org/10.1007/s11464-009-0017-5openalex-snapshot

Survey on path and cycle embedding in some networks

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

Panpositionable hamiltonicity and panconnectivity of the arrangement graphs

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

Mutually independent bipanconnected property of hypercube

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

Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions

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

Optimizing Hamiltonian panconnectedness for the crossed cube architecture

inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.087openalex-snapshot

The bipanpositionable bipancyclic property of the hypercube

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

Geodesic-pancyclic graphs

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

Cycles embedding in folded hypercubes under the conditional fault model

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

Degree sum and graph linkage with prescribed path lengths

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

Connectivity of Cartesian product graphs

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

Subdivisions of graphs: A generalization of paths and cycles

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

Minimum degree and pan- k -linked graphs

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

Graphs with cyclomatic number two having panconnected square

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

Proper connection of graphs

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

Locating pairs of vertices on Hamiltonian cycles

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

Precise location of vertices on Hamiltonian cycles

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

A panconnectivity theorem for bipartite graphs

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

Directed cycle factors with given arcs and lengths

inferred← citeshttps://doi.org/10.1016/j.ins.2010.06.016openalex-snapshot

The panpositionable panconnectedness of augmented cubes

inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.029openalex-snapshot

Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance

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

The 3-colored Ramsey number of even cycles

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

The Ramsey number of a long even cycle versus a star

inferred← citeshttps://doi.org/10.1016/j.kjs.2023.03.008openalex-snapshot

Panconnectivity algorithm for Eisenstein-Jacobi networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.11.004openalex-snapshot

On the bipanpositionable bipanconnectedness of hypercubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.042openalex-snapshot

Minimum degree condition for proper connection number 2

inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00292-xopenalex-snapshot

Vertex pancyclic graphs

inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80048-4openalex-snapshot

Vertex Pancyclic Graphs

inferred← citeshttps://doi.org/10.1093/comjnl/bxz134openalex-snapshot

Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes

inferred← citeshttps://doi.org/10.1109/i-span.2009.88openalex-snapshot

The Mutually Independent Bipanconnected Property for Hypercube

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

Minimum Degrees for Powers of Paths and Cycles

inferred← citeshttps://doi.org/10.1137/23m1565681openalex-snapshot

Ramsey Numbers of Books versus Long Cycles

inferred← citeshttps://doi.org/10.17706/jcp.14.1.44-51openalex-snapshot

The R-Hyper-Panconnectedness of Faulty Crossed Cubes

inferred← citeshttps://doi.org/10.2298/fil2533961wopenalex-snapshot

Ramsey numbers of cycles versus multiple wheels

inferred← citeshttps://doi.org/10.4134/jkms.2014.51.5.919openalex-snapshot

DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS

inferred← citeshttps://doi.org/10.4310/joc.2012.v3.n2.a1openalex-snapshot

Partitioning graphs into paths or cycles of prescribed lengths

inferred← citeshttps://doi.org/10.70675/039ef6c1z0c9ez4554zad6fzcd133c0c284fopenalex-snapshot

Proper and weak-proper trees in edges-colored graphs and multigraphs

inferred← citeshttps://doi.org/10.70675/4ac31a1czd10az4a14z93d0z662ee53cba24openalex-snapshot

A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity

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

On k-path pancyclic 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.