Name
Title | ||
|---|---|---|
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori |
Abstract | ||
|---|---|---|
An interval edge t − coloring of a graph G is a proper edge coloring of G with colors 1, 2, , t … such that at least one edge of G is colored by color , 1, 2, , ii t = … , and the edges incident with each vertex () vV G ∈ are colored by ( ) G dv consecutive colors, where ( ) G dv is the degree of the vertex v in G. In this paper interval edge colorings of bipartite cylinders and bipartite tori are investigated. |
Year | Venue | Keywords |
|---|---|---|
2007 | Clinical Orthopaedics and Related Research | bipartite graph.,proper edge coloring,interval edge coloring,edge coloring,bipartite graph,discrete mathematics,lower bound |
Field | DocType | Volume |
Complete bipartite graph,Discrete mathematics,Edge coloring,Complete coloring,Combinatorics,Edge-transitive graph,Edge cover,List coloring,Bipartite graph,Greedy coloring,Mathematics | Journal | abs/0712.4 |
ISSN | Citations | PageRank |
Proceedings of the CSIT Conference, Yerevan, 2007, 86-88 | 4 | 0.54 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petros A. Petrosyan | 1 | 54 | 14.63 |
| Gagik H. Karapetyan | 2 | 4 | 0.88 |