On the public citation graph

Arc coverings of graphs

https://doi.org/10.1007/bf02412090

0 signed · 120 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(199903)30:3<205::aid-jgt5>3.0.co;2-oopenalex-snapshot

Hamiltonian Chains in Hypergraphs

inferred← citeshttps://doi.org/10.1002/9781118033104.ch3openalex-snapshot

Eulerian and Hamiltonian Graphs

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot

Bibliography

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

Covering 2‐connected 3‐regular graphs with disjoint paths

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

Exact bipartite Tur\'an numbers of large even cycles.

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

On the path partition number of 6‐regular graphs

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

Eigenvalues and cycles of consecutive lengths

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

Some recent results in hamiltonian graphs

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

Cycles in digraphs– a survey

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

Atoll decompositions of graphs

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

A sufficient condition for a graph to contain three disjoint 1‐factors

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

Covering the vertices of a graph by cycles of prescribed length

inferred← citeshttps://doi.org/10.1002/net.6openalex-snapshot

On the construction of combinedk‐fault‐tolerant Hamiltonian graphs

inferred← citeshttps://doi.org/10.1007/978-1-349-03521-2_4openalex-snapshot

Euler Tours and Hamilton Cycles

inferred← citeshttps://doi.org/10.1007/978-1-4471-6407-4_10openalex-snapshot

Graphs and Matrices

inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_1openalex-snapshot

Finding Long Cycles in Balanced Tripartite Graphs: A First Step

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

On path-coverings and Hamilton-connectivity of finite graphs

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

Minimal colorings for properly colored subgraphs

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

Panconnected graphs II

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

Smallest maximally nonhamiltonian graphs

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

Smallest maximally nonhamiltonian graphs II

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

On Hamiltonian bipartite graphs

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

Edge sets contained in circuits

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

Maximale kreise in graphen

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

A sufficient condition for a graph to contain two disjoint hamiltonian cycles

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

Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen

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

Variations on a theorem of Pósa

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

On covering the points of a graph with point disjoint paths

inferred← citeshttps://doi.org/10.1007/s00373-008-0786-8openalex-snapshot

Rainbow Numbers for Cycles with Pendant Edges

inferred← citeshttps://doi.org/10.1007/s00373-010-0999-5openalex-snapshot

Turán Numbers for Disjoint Copies of Graphs

inferred← citeshttps://doi.org/10.1007/s00373-023-02701-4openalex-snapshot

The Global Resilience of Hamiltonicity in G(n, p)

inferred← citeshttps://doi.org/10.1007/s00373-025-02981-yopenalex-snapshot

Rainbow Hamiltonicity with large edge numbers

inferred← citeshttps://doi.org/10.1007/s00493-019-3843-4openalex-snapshot

Stability Results on the Circumference of a Graph

inferred← citeshttps://doi.org/10.1007/s10231-007-0044-3openalex-snapshot

On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree

inferred← citeshttps://doi.org/10.1007/s10587-016-0301-yopenalex-snapshot

Spectral radius and Hamiltonicity of graphs with large minimum degree

inferred← citeshttps://doi.org/10.1007/s41980-019-00294-4openalex-snapshot

Minimum Path Cover in Quasi-claw-Free Graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(71)90019-7openalex-snapshot

Large cycles in graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(73)90035-6openalex-snapshot

Theory of path length distributions I

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

A lower bound for the circumference of a graph

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

Path coverings of the vertices of a tree

inferred← citeshttps://doi.org/10.1016/0012-365x(86)90181-0openalex-snapshot

Partition of a bipartite hamiltonian graph into two cycles

inferred← citeshttps://doi.org/10.1016/0012-365x(88)90069-6openalex-snapshot

Scattering number and extremal non-hamiltonian graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(90)90163-copenalex-snapshot

Extending cycles in graphs

inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0098-oopenalex-snapshot

Relating path coverings to vertex labellings with a condition at distance two

inferred← citeshttps://doi.org/10.1016/0024-3795(94)00139-5openalex-snapshot

Conditional chromatic numbers with forbidden cycles

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

Pancyclic graphs and a conjecture of Bondy and Chvátal

inferred← citeshttps://doi.org/10.1016/0095-8956(77)90071-5openalex-snapshot

On n-Hamiltonian line graphs

inferred← citeshttps://doi.org/10.1016/0095-8956(78)90001-1openalex-snapshot

On path connected graphs

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

Subgraphs intersecting any hamiltonian cycle

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

Spectral analogues of Erdős’ theorem on Hamilton-connected graphs

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

Generalizations of the classics to spanning connectedness

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

Mutually orthogonal hamiltonian connected graphs

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

Geodesic-pancyclic graphs

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

On star-critical and upper size Ramsey numbers

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

The Turán number for spanning linear forests

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

An upper bound on path cover number of regular graphs and its application to Hamiltonian cycle in tough graphs

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

Hamilton-chain saturated hypergraphs

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

On a packing problem of Alon and Yuster

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

The ( p , q ) -extremal problem and the fractional chromatic number of Kneser hypergraphs

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

A stability version for a theorem of Erdős on nonhamiltonian graphs

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

Extremal problems on the Hamiltonicity of claw-free graphs

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

Spectral results on Hamiltonian problem

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

The formula for Turán number of spanning linear forests

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

A note on the 2-power of Hamilton cycles

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

The maximum size of a nonhamiltonian graph with given order and connectivity

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

Proof of a conjecture on the spectral radius condition for [a,b]-factors

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

Ordering Q-indices of graphs: Given size and circumference

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

Spectral radius, fractional [a,b]-factor and ID-factor-critical graphs

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

Spectral extremal problem on the square of ℓ-cycle

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

Rainbow Hamiltonicity and the spectral radius

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

Packing of the k-power of Hamilton cycles

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

On the spectral radius, size and rainbow Hamiltonicity of split graphs

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

The Ramsey numbers of trees versus W6 or W7

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

On extremal hypergraphs for Hamiltonian cycles

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

On saturation games

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

The maximum number of cliques in graphs with prescribed order, circumference and minimum degree

inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.090openalex-snapshot

Hamiltonian Chains in Hypergraphs

inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.065openalex-snapshot

On Extremal Hypergraphs for Hamiltonian Cycles

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

Fault-tolerant hamiltonian connectivity of the WK-recursive networks

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

The Turán number of sparse spanning graphs

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

Completion and deficiency problems

inferred← citeshttps://doi.org/10.1016/j.laa.2016.11.024openalex-snapshot

Spectral analogues of Moon–Moser's theorem on Hamilton paths in bipartite graphs

inferred← citeshttps://doi.org/10.1016/j.laa.2025.10.025openalex-snapshot

Spectral extremal problem for the odd prism

inferred← citeshttps://doi.org/10.1016/j.orl.2023.10.003openalex-snapshot

Reciprocal degree distance and Hamiltonian properties of graphs

inferred← citeshttps://doi.org/10.1016/s0021-9800(67)80036-xopenalex-snapshot

On a graph theorem by dirac

inferred← citeshttps://doi.org/10.1016/s0021-9800(69)80043-8openalex-snapshot

A note on K-path hamiltonian graphs

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70503-xopenalex-snapshot

On Maximal Circuits in Finite Graphs

inferred← citeshttps://doi.org/10.1016/s0924-6509(09)70352-6openalex-snapshot

WITHDRAWN: References

inferred← citeshttps://doi.org/10.1017/fms.2025.28openalex-snapshot

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs

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

A heuristic method for the determination of a Hamiltonian circuit in a graph

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

Two-machine flow shop problem with unit-time operations and conflict graph

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

Spectral radius and Hamiltonian properties of graphs

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

Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles

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

Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius

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

Spectral radius and Hamiltonian properties of graphs, II

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

Spectral and extremal conditions for supereulerian graphs

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

Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian

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

Spectral extremal problem of the p th power of cycles

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

Graph-theoretic techniques for computer intraconnection minimization

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

On the Path Cover Number of Connected Quasi-Claw-Free Graphs

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

Characters of Maximal Non-Hamilton Graph

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

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks

inferred← citeshttps://doi.org/10.1137/18m1194493openalex-snapshot

An Adaptive Multigrid Method Based on Path Cover

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

All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight)

inferred← citeshttps://doi.org/10.1142/9781860943850_others05openalex-snapshot

PART V APPENDICES

inferred← citeshttps://doi.org/10.1186/s40064-016-2746-8openalex-snapshot

Efficient solution for finding Hamilton cycles in undirected graphs

inferred← citeshttps://doi.org/10.18500/1816-9791-2018-18-3-347-353openalex-snapshot

On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity

inferred← citeshttps://doi.org/10.2140/involve.2017.10.801openalex-snapshot

The Hamiltonian problem and t-path traceable graphs

inferred← citeshttps://doi.org/10.2140/pjm.1975.58.159openalex-snapshot

Covering the vertices of a graph by vertex-disjoint paths

inferred← citeshttps://doi.org/10.4153/cmb-1972-012-3openalex-snapshot

Variations on the Hamiltonian Theme

inferred← citeshttps://doi.org/10.46298/dmtcs.452openalex-snapshot

Edge condition for long cycles in bipartite graphs

inferred← citeshttps://doi.org/10.46298/dmtcs.6700openalex-snapshot

Further results on Hendry's Conjecture

inferred← citeshttps://doi.org/10.48550/arxiv.1111.7028openalex-snapshot

On extremal hypergraphs for hamiltonian cycles

inferred← citeshttps://doi.org/10.48550/arxiv.1406.2111openalex-snapshot

On saturation games

inferred← citeshttps://doi.org/10.48550/arxiv.1408.3197openalex-snapshot

The (p,q)-extremal problem and the fractional chromatic number of Kneser hypergraphs

inferred← citeshttps://doi.org/10.48550/arxiv.1609.00114openalex-snapshot

Wiener index, Harary index and Hamiltonicity of graphs

inferred← citeshttps://doi.org/10.48550/arxiv.2102.03855openalex-snapshot

The stability method, eigenvalues and cycles of consecutive lengths

inferred← citeshttps://doi.org/10.48550/arxiv.2107.01416openalex-snapshot

The maximum size of a graph with prescribed order, circumference and minimum degree

inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-099openalex-snapshot

Cycle Partition of Dense Regular Digraphs and Oriented Graphs

inferred← citeshttps://doi.org/10.7494/opmath.2017.37.4.567openalex-snapshot

Anti-Ramsey numbers for disjoint copies of 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.