Edge coloring of bipartite graphs with constraints

Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano

doi:10.1016/s0304-3975(00)00400-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Edge coloring of bipartite graphs with constraints

Ioannis Caragiannis Christos Kaklamanis Pino Persiano

Year: 2002 Journal: Theoretical Computer Science Vol: 270 (1-2)Pages: 361-399 Publisher: Elsevier BV

DOI: 10.1016/s0304-3975(00)00400-x

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Bipartite graph Colored Mathematics Edge coloring Graph Complete bipartite graph Upper and lower bounds Discrete mathematics Graph power Line graph

Metrics

Cited By

1.66

FWCI (Field Weighted Citation Impact)

Refs

0.85

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Edge coloring of bipartite graphs with constraints

Metrics

Citation History

Topics

Related Documents

Edge Coloring of Bipartite Graphs with Constraints

Edge-Coloring Bipartite Graphs

On Edge Coloring Bipartite Graphs

Edge coloring nearly bipartite graphs

Algorithms for edge coloring bipartite graphs