{
  "aliases": [
    "harmonius-chromatic-number"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **harmonious coloring** is a (proper) vertex coloring in which every pair of colors appears on *at most* one pair of adjacent vertices. It is the opposite of the complete coloring, which instead requires every color pairing to occur *at least* once. The **harmonious chromatic number** $\\chi_{H}(G)$ of a [[graph|00C0BR7D7H]] $G$ is the minimum number of colors needed for any harmonious coloring of $G$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "harmonius-chromatic-number"
    ],
    "inventory": [
      "ERGJ5Y1R2K"
    ],
    "kind": "concept",
    "name": "Harmonious coloring",
    "same_as": {
      "wikidata": "Q5659354",
      "wikipedia": "Harmonious coloring"
    },
    "sources": [
      {
        "locator": "Harmonious coloring",
        "mention": "wikipedia://en/690728",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:690728@r1152945582"
      }
    ],
    "tag": "VXS0D789F1"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/VXS0D789F1/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/VXS0D789F1.md",
  "msc": null,
  "name": "Harmonious coloring",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/VXS/VXS0D789F1.md",
  "status": null,
  "tag": "VXS0D789F1",
  "uri": "m2://VXS0D789F1",
  "url": "https://math2.tamnd.com/wiki/harmonious-coloring/",
  "writing": {
    "tag": "VXS0D789F1",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}