On the public citation graph

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

0 signed · 40 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.1002/jgt.3190050102openalex-snapshot
Cycles in digraphs– a survey
inferredcites →https://doi.org/10.1006/jctb.1996.0062openalex-snapshot
Disjoint Directed Cycles
inferredcites →https://doi.org/10.1007/bf02579195openalex-snapshot
Disjoint cycles in digraphs
inferredcites →https://doi.org/10.1016/j.endm.2007.01.008openalex-snapshot
Two proofs of Bermond-Thomassen conjecture for regular tournaments

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4494891openalex-extracted
Strong $K$-Transitive Oriented Graphs with Large Minimum Degree
inferred← citeshttps://doi.org/10.1002/jgt.21740openalex-snapshot
Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
inferred← citeshttps://doi.org/10.1002/jgt.22892openalex-snapshot
Vertex‐disjoint cycles of the same length in tournaments
inferred← citeshttps://doi.org/10.1002/jgt.22972openalex-snapshot
Two disjoint cycles in digraphs
inferred← citeshttps://doi.org/10.1002/jgt.23038openalex-snapshot
Disjoint cycles in tournaments and bipartite tournaments
inferred← citeshttps://doi.org/10.1002/jgt.23255openalex-snapshot
Extremal Results on Disjoint Cycles in Tournaments and Bipartite Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_2openalex-snapshot
Tournaments and Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1873-5openalex-snapshot
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey
inferred← citeshttps://doi.org/10.1007/s00373-023-02631-1openalex-snapshot
Partition and Disjoint Cycles in Digraphs
inferred← citeshttps://doi.org/10.1007/s10255-022-1072-xopenalex-snapshot
On Disjoint Cycles of the Same Length in Tournaments
inferred← citeshttps://doi.org/10.1016/j.amc.2018.02.038openalex-snapshot
Bounds on the k-restricted arc connectivity of some bipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.amc.2018.10.086openalex-snapshot
An improvement of Lichiardopol’s theorem on disjoint cycles in tournaments
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.003openalex-snapshot
Tightening the girth bound for C(k,k) subdivisions in digraphs with minimum out-degree two
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.039openalex-snapshot
Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree
inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.007openalex-snapshot
What is on his mind?
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.009openalex-snapshot
Vertex-disjoint cycles in regular tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2015.02.012openalex-snapshot
Vertex-disjoint cycles in bipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.023openalex-snapshot
Vertex disjoint 4-cycles in bipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2018.04.027openalex-snapshot
An improved bound for disjoint directed cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112127openalex-snapshot
Vertex-disjoint cycles in local tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112878openalex-snapshot
Vertex-disjoint rainbow cycles in edge-colored graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113095openalex-snapshot
Disjoint properly colored cycles in edge-colored complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114126openalex-snapshot
Note on disjoint cycles in multipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103436openalex-snapshot
Properly colored short cycles in edge-colored graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.013openalex-snapshot
Vertex-disjoint cycles in bipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.orl.2013.09.003openalex-snapshot
Disjoint cycles with different length in 4-arc-dominated digraphs
inferred← citeshttps://doi.org/10.1016/j.orl.2014.06.004openalex-snapshot
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs
inferred← citeshttps://doi.org/10.1137/130922653openalex-snapshot
Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
inferred← citeshttps://doi.org/10.1137/16m1108959openalex-snapshot
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/18m1186356openalex-snapshot
On the Number of Vertex-Disjoint Cycles in Digraphs
inferred← citeshttps://doi.org/10.37236/6921openalex-snapshot
Disjoint Cycles of Different Lengths in Graphs and Digraphs
inferred← citeshttps://doi.org/10.37236/7715openalex-snapshot
Lichiardopol’s Conjecture on Disjoint Cycles in Tournaments
inferred← citeshttps://doi.org/10.3990/1.9789036558693openalex-snapshot
Properly colored subgraphs in edge-colored graphs
inferred← citeshttps://doi.org/10.70675/733cbd10z5feaz4101z9064z62ba9a7dac01openalex-snapshot
Algorithmic and structural results on directed cycles in dense digraphs
inferred← citeshttps://doi.org/10.70675/c617000fzb2b7z4dbdz999ez19eabb37504fopenalex-snapshot
Arc colorings and cycles in digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.2020openalex-snapshot
On the number of disjoint 4-cycles in regular tournaments
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.