Edge Coloring and Decompositions of Weighted Graphs
From MaRDI portal
Publication:3541103
Recommendations
- scientific article; zbMATH DE number 7426494
- Generalized edge-colorings of weighted graphs
- Vertex-coloring edge-weightings of graphs
- From edge colorings to graph decompositions -- results and problems
- Vertex coloring edge-weighted digraphs
- Decompositions of edge-colored complete graphs
- Weighted graph colorings
Cites work
- scientific article; zbMATH DE number 2079420 (Why is no real title available?)
- scientific article; zbMATH DE number 1535251 (Why is no real title available?)
- scientific article; zbMATH DE number 3333906 (Why is no real title available?)
- Improved Bounds on Nonblocking 3-Stage Clos Networks
- Nonblocking Multirate Networks
- On Multirate Rearrangeable Clos Networks
- On Nonblocking Multirate Interconnection Networks
- On Rearrangeability of Multirate Clos Networks
- Some remarks about factors of graphs
- [a,b]-factors of graphs
- ``Integer-making theorems
Cited in
(11)- An approximate König's theorem for edge-coloring weighted bipartite graphs
- Equitable factorizations of edge-connected graphs
- Colorful edge decomposition of graphs: some polynomial cases
- Edge weights and vertex colours
- Densities, matchings, and fractional edge-colorings
- scientific article; zbMATH DE number 2061150 (Why is no real title available?)
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
- On weighted bipartite edge coloring
- scientific article; zbMATH DE number 7426494 (Why is no real title available?)
- Generalized hypergraph matching via iterated packing and local ratio
- Vertex coloring edge-weighted digraphs
This page was built for publication: Edge Coloring and Decompositions of Weighted Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541103)