On the public citation graph

Extensions to 2-Factors in Bipartite Graphs

0 signed · 28 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.1006/jctb.2000.2022openalex-snapshot
Long Cycles through a Linear Forest
inferredcites →https://doi.org/10.1007/978-3-642-21919-1openalex-snapshot
Factors and Factorizations of Graphs: Proof Techniques in Factor Theory
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01787577openalex-snapshot
Minimum degree of bipartite graphs and the existence ofk-factors
inferredcites →https://doi.org/10.1007/bf02579180openalex-snapshot
Graph factors
inferredcites →https://doi.org/10.1016/0012-365x(82)90078-4openalex-snapshot
Circuits through specified edges
inferredcites →https://doi.org/10.1016/0012-365x(83)90264-9openalex-snapshot
Proof of a conjecture of Häggkvist on cycles and independent edges
inferredcites →https://doi.org/10.1016/j.ejc.2009.03.007openalex-snapshot
Matching graphs of hypercubes and complete bipartite graphs
inferredcites →https://doi.org/10.1016/j.jctb.2007.02.007openalex-snapshot
Perfect matchings extend to Hamilton cycles in hypercubes
inferredcites →https://doi.org/10.1016/s0021-9800(70)80006-0openalex-snapshot
Flows in infinite graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1957-0083725-9openalex-snapshot
Graphs and Subgraphs
inferredcites →https://doi.org/10.1109/12.536232openalex-snapshot
On diagnosability of large fault sets in regular topology-based computer systems
inferredcites →https://doi.org/10.1137/0406012openalex-snapshot
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
inferredcites →https://doi.org/10.1137/080732687openalex-snapshot
Matching Extendability in Hypercubes
inferredcites →https://doi.org/10.1137/s0895480103432805openalex-snapshot
Hamiltonian Cycles with Prescribed Edges in Hypercubes
inferredcites →https://doi.org/10.1515/dema-1988-0224openalex-snapshot
HAMILTONIAN CYCLES THROUGH MATCHINGS
inferredcites →https://doi.org/10.55937/sut/1108749122openalex-snapshot
Hamiltonian cycles through a linear forest
inferredcites →https://doi.org/10.7151/dmgt.1236openalex-snapshot
Linear forests and ordered cycles

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_2openalex-snapshot
Matchings in Hypercubes Extend to Long Cycles
inferred← citeshttps://doi.org/10.1007/s00493-017-3731-8openalex-snapshot
Matchings Extend into 2-Factors in Hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2019.11.022openalex-snapshot
Minimal graphs for 2-factor extension
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.007openalex-snapshot
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.049openalex-snapshot
On Tuza’s conjecture in dense graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.029openalex-snapshot
Perfect matchings extend to two or more hamiltonian cycles in hypercubes
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.071openalex-snapshot
Towards a problem of Ruskey and Savage on matching extendability
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.02.003openalex-snapshot
Proper orientations and proper chromatic number
inferred← citeshttps://doi.org/10.1137/24m1670093openalex-snapshot
Matchings in Hypercubes Extend to Long Cycles
inferred← citeshttps://doi.org/10.1142/s0129626426500040openalex-snapshot
Extending Matchings to Gray Codes in Hypercubes with Prescribed Endpoints
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.