No label defined (Q3758849)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4008416
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4008416

      Statements

      0 references
      0 references
      0 references
      1985
      0 references
      edge colorings
      0 references
      orthogonal colorings
      0 references
      combinatorial designs
      0 references
      [For the entire collection see Zbl 0619.00006.] We study proper edge colorings of graphs. Two colorings are orthogonal if any two edges which receive the same color in one coloring receive different colors in the other coloring. Let G be a graph which admits a pair of orthogonal colorings using n and m colors. We derive some necessary and some sufficient conditions on G, n and m. A relationship with certain combinatorial designs is discussed, in particular Room squares, Howell designs and orthogonal Latin squares and special cases of orthogonal colorings. Some open problems are presented.
      0 references

      Identifiers