On the public citation graph

Covering the edges of a graph by three odd subgraphs

0 signed · 23 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.3190120305openalex-snapshot
Some results on odd factors of graphs
inferredcites →https://doi.org/10.1007/978-1-4612-9967-7openalex-snapshot
Graph Theory: An Introductory Course
inferredcites →https://doi.org/10.1007/bf02582935openalex-snapshot
On factors with all degrees odd
inferredcites →https://doi.org/10.1007/bf02988324openalex-snapshot
Odd factors of a graph
inferredcites →https://doi.org/10.1016/s0012-365x(01)00424-1openalex-snapshot
Odd subgraphs and matchings
inferredcites →https://doi.org/10.1016/s0012-365x(96)00109-4openalex-snapshot
On graph decompositions modulo k

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.22168openalex-snapshot
Odd 4‐edge‐colorability of graphs
inferred← citeshttps://doi.org/10.1002/jgt.22455openalex-snapshot
Coverability of graph by three odd subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.22991openalex-snapshot
Odd edge‐colorings of subdivisions of odd graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1970-0openalex-snapshot
Decomposition of a Graph into Two Disjoint Odd Subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.12.002openalex-snapshot
Unique-maximum edge-colouring of plane graphs with respect to faces
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.036openalex-snapshot
Facial parity edge colouring of plane pseudographs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.026openalex-snapshot
Facially-constrained colorings of plane graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112884openalex-snapshot
An overview of graph covering and partitioning
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103225openalex-snapshot
Odd decompositions and coverings of graphs
inferred← citeshttps://doi.org/10.1111/aman.13644openalex-snapshot
Citizen‐Suspect: Navigating Surveillance and Policing in Urban Kenya
inferred← citeshttps://doi.org/10.1177/0263775817707528openalex-snapshot
Journeys through the Hidden City: Giving visibility to the Material Events of conflict in Belfast
inferred← citeshttps://doi.org/10.26493/1855-3974.129.be3openalex-snapshot
Facial parity edge colouring
inferred← citeshttps://doi.org/10.26493/1855-3974.576.895openalex-snapshot
Odd edge coloring of graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.957.97copenalex-snapshot
Odd edge-colorability of subcubic graphs
inferred← citeshttps://doi.org/10.37560/matbil15200041popenalex-snapshot
COVERING THE EDGES OF A GRAPH BY FOUR ODD SUBGRAPHS
inferred← citeshttps://doi.org/10.5753/etc.2020.11087openalex-snapshot
The odd chromatic index of almost all graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1690openalex-snapshot
Decompositions of plane graphs under parity constrains given by faces
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.