Edge Coloring of Bipartite Graphs with Constraints

Ioannis Caragiannis; Christos Kaklamanis; Pino Persiano

doi:10.1007/3-540-48340-3_34

ScienceGate Book Chapters

BOOK-CHAPTER

Edge Coloring of Bipartite Graphs with Constraints

Ioannis Caragiannis Christos Kaklamanis Pino Persiano

Year: 1999 Lecture notes in computer science Pages: 376-386 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-48340-3_34

Get Full-Text PDF Get Analytical Report

Keywords:

Bipartite graph Edge coloring Graph coloring Combinatorics Computer science List coloring Complete bipartite graph Complete coloring Enhanced Data Rates for GSM Evolution Greedy coloring Graph Fractional coloring Discrete mathematics Mathematics Line graph Graph power Artificial intelligence

Metrics

Cited By

1.48

FWCI (Field Weighted Citation Impact)

Refs

0.83

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Edge Coloring of Bipartite Graphs with Constraints

Metrics

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