On the public citation graph
On the $1.1$ Edge-Coloring of Multigraphs
0 signed · 85 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.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.1016/0001-8708(78)90018-xopenalex-snapshot
Edge-colourings of graphs
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.1112/plms/s3-38.3.423openalex-snapshot
On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
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.1002/1098-2418(200009)17:2<117::aid-rsa3>3.0.co;2-9openalex-snapshot
Asymptotics of the list-chromatic index for multigraphs
inferred← citeshttps://doi.org/10.1002/jgt.20334openalex-snapshot
Bounding χ in terms of ω and Δ for quasi‐line graphs
inferred← citeshttps://doi.org/10.1002/jgt.20469openalex-snapshot
Vizing's coloring algorithm and the fan number
inferred← citeshttps://doi.org/10.1002/rsa.21074openalex-snapshot
Efficiently list-edge coloring multigraphs asymptotically optimally
inferred← citeshttps://doi.org/10.1006/jagm.2001.1169openalex-snapshot
How Helpers Hasten h-Relations
inferred← citeshttps://doi.org/10.1006/jctb.1996.0067openalex-snapshot
Asymptotics of the Chromatic Index for Multigraphs
inferred← citeshttps://doi.org/10.1007/11496199_3openalex-snapshot
Complexity of Minimal Tree Routing and Coloring
inferred← citeshttps://doi.org/10.1007/11573036_6openalex-snapshot
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
inferred← citeshttps://doi.org/10.1007/11671541_3openalex-snapshot
Approximation Algorithms for Path Coloring in Trees
inferred← citeshttps://doi.org/10.1007/11830924_14openalex-snapshot
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
inferred← citeshttps://doi.org/10.1007/11944836_13openalex-snapshot
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
inferred← citeshttps://doi.org/10.1007/3-540-44688-5_12openalex-snapshot
An Experimental Study of Data Migration Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_11openalex-snapshot
Approximating Maximum Edge Coloring in Multigraphs
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_48openalex-snapshot
Scheduling file transfers under port and channel constraints
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_10openalex-snapshot
Approximation on the web: A compendium of NP optimization problems
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_56openalex-snapshot
Improved Results for Data Migration and Open Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_2openalex-snapshot
Multicoloring: Problems and Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_21openalex-snapshot
Strong Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_19openalex-snapshot
Resource Allocation Problems in Multifiber WDM Tree Networks
inferred← citeshttps://doi.org/10.1007/bfb0024499openalex-snapshot
Off-line and on-line call-scheduling in stars and trees
inferred← citeshttps://doi.org/10.1007/s00373-018-1986-5openalex-snapshot
Graph Edge Coloring: A Survey
inferred← citeshttps://doi.org/10.1007/s00453-007-9118-2openalex-snapshot
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
inferred← citeshttps://doi.org/10.1007/s00453-008-9214-yopenalex-snapshot
Algorithms for Data Migration
inferred← citeshttps://doi.org/10.1007/s00607-007-0234-2openalex-snapshot
Path multicoloring with fewer colors in spiders and caterpillars
inferred← citeshttps://doi.org/10.1007/s10878-009-9232-yopenalex-snapshot
Approximating the chromatic index of multigraphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00564-6openalex-snapshot
A $$\frac{5}{2}$$-approximation algorithm for coloring rooted subtrees of a degree 3 tree
inferred← citeshttps://doi.org/10.1007/s10878-025-01348-6openalex-snapshot
Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphs
inferred← citeshttps://doi.org/10.1007/s12351-019-00535-8openalex-snapshot
A value for games on colored communication structures
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.021openalex-snapshot
Efficient algorithms for wavelength assignment on trees of rings
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.046openalex-snapshot
On Vizing’s bound for the chromatic index of a multigraph
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.04.014openalex-snapshot
An upper bound for the chromatic number of line graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.009openalex-snapshot
Data migration to minimize the total completion time
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.04.001openalex-snapshot
Graph edge colouring: Tashkinov trees and Goldberg's conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.01.006openalex-snapshot
Chromatic index determined by fractional chromatic index
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.03.004openalex-snapshot
Structural properties of edge-chromatic critical multigraphs
inferred← citeshttps://doi.org/10.1016/j.jda.2007.02.001openalex-snapshot
Inapproximability and approximability of minimal tree routing and coloring
inferred← citeshttps://doi.org/10.1016/j.optcom.2025.131883openalex-snapshot
Optimum 6G/7G quantum network design: Survey
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00138-0openalex-snapshot
Improving a family of approximation algorithms to edge color multigraphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00152-8openalex-snapshot
The complexity of path coloring and call scheduling
inferred← citeshttps://doi.org/10.1109/90.909024openalex-snapshot
On the wavelength assignment problem in multifiber WDM star and ring networks
inferred← citeshttps://doi.org/10.1109/broadnets.2008.4769141openalex-snapshot
Minimum wavelength assignment for multicast traffic in all-optical WDM tree networks
inferred← citeshttps://doi.org/10.1109/hicss.1997.667220openalex-snapshot
Call scheduling in trees, rings and meshes
inferred← citeshttps://doi.org/10.1109/icdcs.2011.46openalex-snapshot
Data Migration in Heterogeneous Storage Systems
inferred← citeshttps://doi.org/10.1109/infcom.2000.832577openalex-snapshot
On the wavelength assignment problem in multifiber WDM star and ring networks
inferred← citeshttps://doi.org/10.1109/ipdps.2005.433openalex-snapshot
Tight Bounds for Wavelength Assignment on Trees of Rings
inferred← citeshttps://doi.org/10.1109/nca.2017.8171340openalex-snapshot
Data migration algorithms in heterogeneous storage systems: A comparative performance evaluation
inferred← citeshttps://doi.org/10.1109/tnet.2005.852873openalex-snapshot
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
inferred← citeshttps://doi.org/10.1109/wcnc.2007.57openalex-snapshot
Cross-Layer Optimization for OFDMA-Based Wireless Mesh Backhaul Networks
inferred← citeshttps://doi.org/10.1137/s009753970342585xopenalex-snapshot
Algorithms for Data Migration with Cloning
inferred← citeshttps://doi.org/10.1145/1125994.1126001openalex-snapshot
Improved results for data migration and open shop scheduling
inferred← citeshttps://doi.org/10.1145/1361192.1361198openalex-snapshot
An asymptotic approximation scheme for multigraph edge coloring
inferred← citeshttps://doi.org/10.1145/306198.306210openalex-snapshot
How to find the best approximation results
inferred← citeshttps://doi.org/10.1145/335603.335880openalex-snapshot
A grouping genetic algorithm for coloring the edges of graphs
inferred← citeshttps://doi.org/10.1145/347792.347808openalex-snapshot
Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks
inferred← citeshttps://doi.org/10.1145/3708597.3708609openalex-snapshot
Data Migration in Large Scale Storage Systems with Varying File Sizes
inferred← citeshttps://doi.org/10.1145/773153.773156openalex-snapshot
Algorithms for data migration with cloning
inferred← citeshttps://doi.org/10.1145/938985.938991openalex-snapshot
Characterizing achievable rates in multi-hop wireless networks
inferred← citeshttps://doi.org/10.1201/9781351236423-38openalex-snapshot
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs
inferred← citeshttps://doi.org/10.3233/hsn-1999-173openalex-snapshot
On bounds for the wavelength assignment problem on optical ring networks
inferred← citeshttps://doi.org/10.3390/a12020034openalex-snapshot
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
inferred← citeshttps://doi.org/10.37236/1011openalex-snapshot
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs
inferred← citeshttps://doi.org/10.37236/4847openalex-snapshot
Clusters in a Multigraph with Elevated Density
inferred← citeshttps://doi.org/10.3929/ethz-a-004832472openalex-snapshot
On the design and operation of high-performance optical networks
inferred← citeshttps://doi.org/10.46298/dmtcs.3401openalex-snapshot
An upper bound for the chromatic number of line graphs
inferred← citeshttps://doi.org/10.47443/dml.2021.s105openalex-snapshot
A brief history of edge-colorings – with personal reminiscences
inferred← citeshttps://doi.org/10.48550/arxiv.1010.4018openalex-snapshot
A Paradigm for Channel Assignment and Data Migration in Distributed Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1706.04476openalex-snapshot
A conditional greedy algorithm for edge-coloring
inferred← citeshttps://doi.org/10.82308/16876openalex-snapshot
Claw-free graphs and two conjectures on omega, Delta, and chi
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.