You are currently offline. Some features of the site may not work correctly.

Corpus ID: 119263600

The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares

@article{Wiederrecht2017TheSC,
title={The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares},
author={S. Wiederrecht},
journal={arXiv: Combinatorics},
year={2017}
}

A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not mapped to the same color. This constraint may be interpreted in terms of the distance between to vertices and so a more general coloring concept can be defined: The strong coloring of a graph. So a k-strong coloring is a coloring where two vertices may not have the same color if their distance to each other is at most k. The 2-strong coloring of the line graph is known asâ€¦Â CONTINUE READING