On the public citation graph

Edge-coloring algorithms

https://doi.org/10.1007/bfb0015243
0 signed · 52 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.3190080115openalex-snapshot
Edge‐coloring of multigraphs: Recoloring technique
inferredcites →https://doi.org/10.1002/jgt.3190100202openalex-snapshot
A generalization of edge‐coloring in graphs
inferredcites →https://doi.org/10.1002/sapm1949281148openalex-snapshot
A Theorem on Coloring the Lines of a Network
inferredcites →https://doi.org/10.1006/jagm.1996.0008openalex-snapshot
A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
inferredcites →https://doi.org/10.1007/3-540-57273-2_76openalex-snapshot
A linear algorithm for edge-coloring partial k-trees
inferredcites →https://doi.org/10.1007/3-540-58218-5_33openalex-snapshot
A parallel algorithm for edge-coloring partial k-trees
inferredcites →https://doi.org/10.1007/3-540-58325-4_182openalex-snapshot
Edge-coloring and f-coloring for various classes of graphs
inferredcites →https://doi.org/10.1007/978-94-011-7557-9_18openalex-snapshot
A Few Remarks on Chromatic Scheduling
inferredcites →https://doi.org/10.1007/bf01456961openalex-snapshot
Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
inferredcites →https://doi.org/10.1007/bf01885700openalex-snapshot
The chromatic class of a multigraph
inferredcites →https://doi.org/10.1007/bf02026597openalex-snapshot
Some results in chromatic scheduling
inferredcites →https://doi.org/10.1007/bf02122697openalex-snapshot
On thefg-coloring of graphs
inferredcites →https://doi.org/10.1007/bf02128672openalex-snapshot
Colouring series-parallel graphs
inferredcites →https://doi.org/10.1007/bfb0023853openalex-snapshot
An efficient algorithm for edge-coloring series parallel multigraphs
inferredcites →https://doi.org/10.1007/bfb0030836openalex-snapshot
Simple reduction of f-colorings to edge-colorings
inferredcites →https://doi.org/10.1016/0012-365x(84)90078-5openalex-snapshot
A new method of proving theorems on chromatic index
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0196-6774(86)90039-8openalex-snapshot
A better than “best possible” algorithm to edge color multigraphs
inferredcites →https://doi.org/10.1016/0196-6774(87)90026-5openalex-snapshot
Efficient parallel algorithms for edge coloring problems
inferredcites →https://doi.org/10.1016/0196-6774(89)90022-9openalex-snapshot
Fast algorithms for edge-coloring planar graphs
inferredcites →https://doi.org/10.1016/0196-6774(90)90013-5openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferredcites →https://doi.org/10.1016/0196-6774(90)90032-aopenalex-snapshot
Improved edge-coloring algorithms for planar graphs
inferredcites →https://doi.org/10.1057/jors.1976.126openalex-snapshot
Combinatorial Programming: Methods and Applications
inferredcites →https://doi.org/10.1109/31.1747openalex-snapshot
On the f-coloring of multigraphs
inferredcites →https://doi.org/10.1109/tc.1981.6312171openalex-snapshot
A fast parallel algorithm for routing in permutation networks
inferredcites →https://doi.org/10.1112/plms/s3-38.3.423openalex-snapshot
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
inferredcites →https://doi.org/10.1137/0210055openalex-snapshot
The NP-Completeness of Edge-Coloring
inferredcites →https://doi.org/10.1137/0211009openalex-snapshot
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
inferredcites →https://doi.org/10.1137/0211043openalex-snapshot
On Edge Coloring Bipartite Graphs
inferredcites →https://doi.org/10.1137/0214054openalex-snapshot
Scheduling File Transfers
inferredcites →https://doi.org/10.1137/0403035openalex-snapshot
On the $1.1$ Edge-Coloring of Multigraphs
inferredcites →https://doi.org/10.1142/s0129054193000079openalex-snapshot
SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
inferredcites →https://doi.org/10.1145/800133.804346openalex-snapshot
Algorithms for edge coloring bipartite graphs
inferredcites →https://doi.org/10.7146/math.scand.a-11685openalex-snapshot
On edge-colorings of graphs.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.2001.1169openalex-snapshot
How Helpers Hasten h-Relations
inferred← citeshttps://doi.org/10.1007/s00180-021-01127-xopenalex-snapshot
An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
inferred← citeshttps://doi.org/10.1007/s004530010017openalex-snapshot
A Linear Algorithm for Finding \boldmath[{ g,f }]-Colorings of Partial \boldmath{ k }-Trees
inferred← citeshttps://doi.org/10.1007/s004930170002openalex-snapshot
Edge-Coloring Bipartite Multigraphs in O ( E log D ) Time
inferred← citeshttps://doi.org/10.1007/s11750-013-0312-xopenalex-snapshot
An integer linear formulation for the file transfer scheduling problem
inferred← citeshttps://doi.org/10.1016/j.dam.2006.05.010openalex-snapshot
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.002openalex-snapshot
Approximating the maximum 2- and 3-edge-colorable subgraph problems
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.078openalex-snapshot
Minimum multiplicity edge coloring via orientation
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.017openalex-snapshot
Approximating the maximum 3-edge-colorable subgraph problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.03.016openalex-snapshot
An investigation into two bin packing problems with ordering and orientation implications
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.03.038openalex-snapshot
Edge coloring: A natural model for sports scheduling
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128283openalex-snapshot
Candidate range limitation for efficient rainbow clique detection
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.005openalex-snapshot
Improved edge-coloring with three colors
inferred← citeshttps://doi.org/10.1109/acc.2012.6315569openalex-snapshot
Controlling wild mobile robots using virtual gates and discrete transitions
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485929openalex-snapshot
Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks
inferred← citeshttps://doi.org/10.1109/tpds.2016.2571281openalex-snapshot
Elastic Reliability Optimization Through Peer-to-Peer Checkpointing in Cloud Computing
inferred← citeshttps://doi.org/10.2478/v10209-011-0012-yopenalex-snapshot
A survey of graph coloring - its types, methods and applications
inferred← citeshttps://doi.org/10.37099/mtu.dc.etds/202openalex-snapshot
Edge coloring BIBDS and constructing MOELRs
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.