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
Figures from this paper
Figures
figure 2.1 figure 2.2 figure 2.3 figure 2.4 figure 3.1 figure 3.10 figure 3.11 figure 3.2 figure 3.3 figure 3.4 figure 3.5 figure 3.6 figure 3.7 figure 3.8 figure 3.9 figure 4.1 figure 4.10 figure 4.11 figure 4.12 figure 4.13 figure 4.14 figure 4.15 figure 4.16 figure 4.17 figure 4.18 figure 4.19 figure 4.2 figure 4.20 figure 4.21 figure 4.22 figure 4.23 figure 4.24 figure 4.25 figure 4.26 figure 4.27 figure 4.28 figure 4.29 figure 4.3 figure 4.30 figure 4.31 figure 4.32 figure 4.33 figure 4.34 figure 4.35 figure 4.36 figure 4.37 figure 4.38 figure 4.39 figure 4.4 figure 4.40 figure 4.41 figure 4.42 figure 4.43 figure 4.44 figure 4.5 figure 4.6 figure 4.7 figure 4.8 figure 4.9 figure 5.1 figure 5.2 figure 5.3 figure 5.4 figure 5.5
References
SHOWING 1-10 OF 63 REFERENCES
On the Complexity of Some Colorful Problems Parameterized by Treewidth
- Mathematics, Computer Science
- COCOA
- 2007
- 85
- PDF
On acyclic edge-coloring of the complete bipartite graphs K2p-1, 2p-1 for odd prime p
- Mathematics, Computer Science
- Discret. Math.
- 2016
- 2
Finding a maximum induced matching in weakly chordal graphs
- Mathematics, Computer Science
- Discret. Math.
- 2003
- 88