On the public citation graph
Beyond the Vizing's Bound for at Most Seven Colors
0 signed · 29 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.20629openalex-snapshot
Maximum Δ‐edge‐colorable subgraphs of class II graphs
inferredcites →https://doi.org/10.1002/sapm1949281148openalex-snapshot
A Theorem on Coloring the Lines of a Network
inferredcites →https://doi.org/10.1007/3-540-45753-4_11openalex-snapshot
Approximating Maximum Edge Coloring in Multigraphs
inferredcites →https://doi.org/10.1007/978-3-642-13731-0_37openalex-snapshot
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph
inferredcites →https://doi.org/10.1007/s10878-009-9232-yopenalex-snapshot
Approximating the chromatic index of multigraphs
inferredcites →https://doi.org/10.1016/0012-365x(80)90002-3openalex-snapshot
A matching problem with side conditions
inferredcites →https://doi.org/10.1016/0012-365x(94)00254-gopenalex-snapshot
Parsimonious edge coloring
inferredcites →https://doi.org/10.1016/0196-6774(83)90032-9openalex-snapshot
NP completeness of finding the chromatic index of regular graphs
inferredcites →https://doi.org/10.1016/j.dam.2009.04.002openalex-snapshot
Approximating the maximum 2- and 3-edge-colorable subgraph problems
inferredcites →https://doi.org/10.1016/j.dam.2010.08.010openalex-snapshot
Approximating maximum edge 2-coloring in simple graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.11.017openalex-snapshot
Approximating the maximum 3-edge-colorable subgraph problem
inferredcites →https://doi.org/10.1016/j.jda.2007.08.002openalex-snapshot
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.008openalex-snapshot
Approximating maximum edge 2-coloring in simple graphs via local improvement
inferredcites →https://doi.org/10.1145/1361192.1361198openalex-snapshot
An asymptotic approximation scheme for multigraph edge coloring
inferredcites →https://doi.org/10.2307/2369235openalex-snapshot
On the Geographical Problem of the Four Colours
inferredcites →https://doi.org/10.5860/choice.31-0991openalex-snapshot
Aspects of combinatorics: a wide-ranging introduction
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.22848openalex-snapshot
Between proper and strong edge‐colorings of subcubic graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-75078-7_24openalex-snapshot
Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem
inferred← citeshttps://doi.org/10.1007/s00236-016-0283-0openalex-snapshot
Online edge coloring of paths and trees with a fixed number of colors
inferred← citeshttps://doi.org/10.1007/s00453-024-01214-7openalex-snapshot
Diverse Pairs of Matchings
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.013openalex-snapshot
On maximum k -edge-colorable subgraphs of bipartite graphs
inferred← citeshttps://doi.org/10.1145/3797905.3800555openalex-snapshot
DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters
inferred← citeshttps://doi.org/10.4230/lipics.swat.2020.26openalex-snapshot
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3817openalex-snapshot
Online Edge Coloring of Paths and Trees with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.48550/arxiv.1904.09246openalex-snapshot
Assigning tasks to agents under time conflicts: a parameterized complexity approach
inferred← citeshttps://doi.org/10.5614/ejgta.2018.6.2.9openalex-snapshot
Parsimonious edge-coloring on surfaces
inferred← citeshttps://doi.org/10.56415/basm.y2023.i3.p26openalex-snapshot
Graphs, Disjoint Matchings and Some Inequalities
inferred← citeshttps://doi.org/10.7155/jgaa.v28i1.2931openalex-snapshot
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
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.