Equitable edge-colorings of simple graphs
From MaRDI portal
Recommendations
Cites work
- (r,r+1)-factorizations of (d,d+1)-graphs
- A generalization of edge-coloring in graphs
- A sufficient condition for equitable edge-colourings of simple graphs
- Class one graphs
- scientific article; zbMATH DE number 3893226 (Why is no real title available?)
- Improved bounds for the chromatic index of graphs and multigraphs
- Regular Graphs of High Degree are 1-Factorizable
- Some graphs of class 1 for \(f\)-colorings
Cited in
(21)- A sufficient condition for equitable edge-colourings of simple graphs
- Balanced edge colorings.
- Equitable neighbour-sum-distinguishing edge and total colourings
- On edge covering colorings of graphs
- Polychromatic colorings of hypergraphs with high balance
- Equitable factorizations of edge-connected graphs
- On the equitable edge-coloring of 1-planar graphs and planar graphs
- f-class two graphs whose f-cores have maximum degree two
- The equitable edge-colouring of outerplanar graphs
- Some class 1 graphs on \(g_c\)-colorings
- Some Topics on Edge-Coloring
- 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 edge coloring of splitting graph of some classes of wheel graphs.
- Equitable edge chromatic number of \(P_m\otimes S_n^0\) and \(S_m^0\otimes S_n^0\)
- Equitable strongly balanced edge coloring of graphs.
- scientific article; zbMATH DE number 6729895 (Why is no real title available?)
- On equitable edge-coloring of multigraphs
- A note on polychromatic colorings of plane graphs
- Equitable edge coloring of splitting graph of some classes of wheel graphs.
This page was built for publication: Equitable edge-colorings of simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083408)
