On evenly-equitable, balanced edge-colorings and related notions

DOI10.1155/2015/201427zbMath1322.05057OpenAlexW2067021421WikidataQ59106871 ScholiaQ59106871MaRDI QIDQ499817

C. A. Rodger, Aras Erzurumluoğlu

Publication date: 6 October 2015

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/201427

zbMATH Keywords

even grapheven \(k\)-edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Internally fair factorizations and internally fair holey factorizations with prescribed regularity

Cites Work

• Class one graphs
• Canonical edge-colourings of locally finite graphs
• A sufficient condition for equitable edge-colourings of simple graphs
• Fair Hamilton decompositions of complete multipartite graphs
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• Multiply balanced edge colorings of multigraphs
• Equitable edge-colorings of simple graphs
• The chromatic index of complete multipartite graphs
• On A Particular Conference Scheduling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On evenly-equitable, balanced edge-colorings and related notions