On the public citation graph

Vertex Disjoint Cycles of Different Length in Digraphs

0 signed · 26 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/bf02579195openalex-snapshot
Disjoint cycles in digraphs
inferredcites →https://doi.org/10.1016/j.jctb.2004.09.004openalex-snapshot
Graphs and digraphs with all 2-factors isomorphic
inferredcites →https://doi.org/10.1016/j.jctb.2008.09.001openalex-snapshot
Corrigendum to “Graphs and digraphs with all 2-factors isomorphic” [J. Combin. Theory Ser. B 92 (2) (2004) 395–404]

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.21843openalex-snapshot
On 2‐Colorings of Hypergraphs
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.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/s00373-022-02465-3openalex-snapshot
Disjoint Cycles of Different Lengths in 3-Regular Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02631-1openalex-snapshot
Partition and Disjoint Cycles in Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02686-0openalex-snapshot
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments
inferred← citeshttps://doi.org/10.1016/j.amc.2024.129253openalex-snapshot
Extremal function of two independent chorded cycles in a bipartite graph
inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.016openalex-snapshot
On vertex disjoint cycles of different lengths in 3-regular digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.03.024openalex-snapshot
On 3-regular digraphs without vertex disjoint cycles of different lengths
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111632openalex-snapshot
On 3-regular digraphs of girth 4
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112117openalex-snapshot
Vertex-disjoint rainbow triangles in edge-colored graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112819openalex-snapshot
Vertex-disjoint cycles of different lengths in multipartite 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.2026.115074openalex-snapshot
The bipartite Turán number of independent cycles with different lengths
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/18m1186356openalex-snapshot
On the Number of Vertex-Disjoint Cycles in Digraphs
inferred← citeshttps://doi.org/10.1137/20m1351047openalex-snapshot
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths
inferred← citeshttps://doi.org/10.1137/20m1382398openalex-snapshot
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
inferred← citeshttps://doi.org/10.48550/arxiv.2011.11605openalex-snapshot
Disjoint cycles with length constraints in digraphs of large connectivity or minimum degree
inferred← citeshttps://doi.org/10.70675/7fb4cd71zf9c0z45dfz8cd2z8bb1d6095439openalex-snapshot
Rainbow subgraphs and properly colored subgraphs in colored 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.