On equitable edge-coloring of multigraphs
From MaRDI portal
Recommendations
Cited in
(16)- A sufficient condition for equitable edge-colourings of simple graphs
- The method of coloring in graphs and its application
- The equitable edge-colouring of outerplanar graphs
- Homogeneous edge-colorings of graphs
- Equipartite edge colouring of multigraphs
- Multiply balanced edge colorings of multigraphs
- A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
- Equitable edge-colorings of simple graphs
- scientific article; zbMATH DE number 3977022 (Why is no real title available?)
- scientific article; zbMATH DE number 2016735 (Why is no real title available?)
- On evenly-equitable, balanced edge-colorings and related notions
- Edge homogeneous colorings
- Equitable strongly balanced edge coloring of graphs.
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
- scientific article; zbMATH DE number 6770081 (Why is no real title available?)
This page was built for publication: On equitable edge-coloring of multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5455780)