A sufficient condition for equitable edge-colourings of simple graphs
From MaRDI portal
Publication:1322183
DOI10.1016/0012-365X(94)90112-0zbMath0798.05022OpenAlexW1998963995MaRDI QIDQ1322183
Dominique de Werra, Anthony J. W. Hilton
Publication date: 9 June 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90112-0
Related Items (25)
Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) ⋮ Polychromatic colorings of hypergraphs with high balance ⋮ Equitable factorizations of edge-connected graphs ⋮ Coloration de graphes : fondements et applications ⋮ Edge covering coloring of nearly bipartite graphs ⋮ Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers ⋮ Equitable edge coloring on tensor product of graphs ⋮ Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰ ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ The method of coloring in graphs and its application ⋮ On balanced colorings of sparse hypergraphs ⋮ New Bounds for the Nearly Equitable Edge Coloring Problem ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ A special \(f\)-edge cover-coloring of multigraphs ⋮ \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs ⋮ ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS ⋮ Edge covered critical multigraphs ⋮ A note on the edge cover chromatic index of multigraphs ⋮ Equitable edge-colorings of simple graphs ⋮ On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph ⋮ Edge-coloring of multigraphs ⋮ Fair Hamilton decompositions of complete multipartite graphs ⋮ A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions ⋮ A note on polychromatic colorings of plane graphs ⋮ Some sufficient conditions for a graph to be of \(C_f\) 1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Class one graphs
- Obstructions for regular colorings
- Equitable and proportional coloring of trees
- Méthode et théorème général de coloration des aretes d'un multigraphe
- Lower bounds on the cover-index of a graph
- A generalization of edge-coloring in graphs
- On decompositions of a multi-graph into spanning subgraphs
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
- On edge-colorings of graphs.
- Equitable Coloring
This page was built for publication: A sufficient condition for equitable edge-colourings of simple graphs
