Compact cyclic edge-colorings of graphs
| Autor: | Adam Nadolski |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Discrete mathematics
Circular edge-coloring ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Complete coloring Compact edge-coloring Graph Theoretical Computer Science Combinatorics Greedy coloring Edge coloring Colored Discrete Mathematics and Combinatorics ComputingMethodologies_COMPUTERGRAPHICS Mathematics |
| Zdroj: | Discrete Mathematics. 308:2407-2417 |
| ISSN: | 0012-365X |
| Popis: | The paper is devoted to a model of compact cyclic edge-coloring of graphs. This variant of edge-coloring finds its applications in modeling schedules in production systems, in which production proceeds in a cyclic way. We point out optimal colorings for some graph classes and we construct graphs which cannot be colored in a compact cyclic manner. Moreover, we prove some theoretical properties of considered coloring model such as upper bounds on the number of colors in optimal compact cyclic coloring. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect