JOURNAL ARTICLE
On Edge Coloring Bipartite Graphs
Year: 1982 Journal: SIAM Journal on Computing Vol: 11 (3)Pages: 540-546 Publisher: Society for Industrial and Applied Mathematics
Abstract
The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.Keywordsedge coloringbipartite graphmultigraphmatchingpartition
Keywords:
Bipartite graph Combinatorics Edge coloring Mathematics Graph coloring Complete bipartite graph Complete coloring List coloring Enhanced Data Rates for GSM Evolution Discrete mathematics Fractional coloring Graph Graph power Computer science Line graph
Metrics
164
Cited By
2.69
FWCI (Field Weighted Citation Impact)
4
Refs
0.91
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
graph theory and CDMA systems
Physical Sciences → Engineering → Electrical and Electronic Engineering
Computational Geometry and Mesh Generation
Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design
Related Documents
JOURNAL ARTICLE
Edge-Coloring Bipartite Graphs
Journal: Journal of Algorithms Year: 2000 Vol: 34 (2)Pages: 390-396
JOURNAL ARTICLE
Edge coloring nearly bipartite graphs
Journal: Operations Research Letters Year: 1999 Vol: 24 (1-2)Pages: 11-14
JOURNAL ARTICLE
Edge covering coloring of nearly bipartite graphs
Jihui WangXia ZhangGuizhen Liu
Journal: Journal of Applied Mathematics and Computing Year: 2006 Vol: 22 (1-2)Pages: 435-440
JOURNAL ARTICLE
Edge coloring of bipartite graphs with constraints
Ioannis CaragiannisChristos KaklamanisPino Persiano
Journal: Theoretical Computer Science Year: 2002 Vol: 270 (1-2)Pages: 361-399