On equitable edge-coloring of multigraphs

zbMATH Open1156.05314MaRDI QIDQ5455780FDOQ5455780

Authors: Changqing Xu, Guizhen Liu 

Publication date: 4 April 2008

Recommendations

• Equitable edge-colorings of simple graphs
• A sufficient condition for equitable edge-colourings of simple graphs
• scientific article; zbMATH DE number 1302199
• scientific article; zbMATH DE number 2016735
• On the equitable edge-coloring of 1-planar graphs and planar graphs

zbMATH Keywords

multigraphequitable edge-coloringnearly equitable edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (15)

• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
• Homogeneous edge-colorings of graphs
• Equitable edge-colorings of simple graphs
• Multiply balanced edge colorings of multigraphs
• A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equipartite edge colouring of multigraphs
• Equitable strongly balanced edge coloring of graphs.
• The method of coloring in graphs and its application
• A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
• Title not available (Why is that?)
• On evenly-equitable, balanced edge-colorings and related notions
• Edge homogeneous colorings
• The equitable edge-colouring of outerplanar graphs

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)