Corpus ID: 119263600

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

  title={The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares},
  author={S. Wiederrecht},
  journal={arXiv: Combinatorics},
  • S. Wiederrecht
  • Published 2017
  • Mathematics
  • arXiv: Combinatorics
  • 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


    The strong chromatic index of Halin graphs
    • 19
    Algorithmic Aspects of Acyclic Edge Colorings
    • 52
    • PDF
    Acyclic edge colorings of graphs
    • 108
    On the Complexity of Some Colorful Problems Parameterized by Treewidth
    • 85
    • PDF
    Finding a maximum induced matching in weakly chordal graphs
    • 88
    Characterizations of strongly chordal graphs
    • M. Farber
    • Mathematics, Computer Science
    • Discret. Math.
    • 1983
    • 324