6533b86ffe1ef96bd12cd3ea
RESEARCH PRODUCT
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
Jean-luc BarilOlivier Tognisubject
Circular coloringComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesGraphTheoretical Computer ScienceCombinatoricsGreedy coloringIndifference graphChordal graphDiscrete Mathematics and Combinatorics0101 mathematicsFractional coloringComputingMilieux_MISCELLANEOUSComputingMethodologies_COMPUTERGRAPHICSMathematicsDiscrete mathematicsk-tuple edge-coloringClique-sum010102 general mathematics[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]1-planar graphMetric dimension010201 computation theory & mathematicsIndependent setMaximal independent setNeighbor-distinguishingMathematicsofComputing_DISCRETEMATHEMATICSAdjacent vertex-distinguishingdescription
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2009-08-01 |