Skip to Main Content
ASME Press Select Proceedings

International Conference on Electronics, Information and Communication Engineering (EICE 2012)

By
Garry Lee
Garry Lee
Information Engineering Research Institute
Search for other works by this author on:
ISBN:
9780791859971
No. of Pages:
1008
Publisher:
ASME Press
Publication date:
2012

An edge-coloring of a graph G is equitable if, for each vV(G), the number of edges colored with any one color incident with v differs form the number of edges colored with any other color incident with v by at most one. By study the factorization, we prove that 1) every (k(f−1)+1,kf)-graph has equitable edge-coloring with k colors; 2) for any subgraph H with r edges of (k(f−1 ),kf −1)-graph G, there exist a subgraph R with an equitable edge-coloring orthogonal to H.

Abstract
Keywords
Introduction
Useful Lemmas
Proof of the Main Result
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal