What are the Hajós Construction and k-constructible graphs? [Graph Theory]
This video introduces the Hajós Construction with several illustrated examples. The Hajós Construction is an operation in graph theory. It takes as its input two graphs, and outputs a new graph, which is essentially a special merging of the input graphs. The Hajós Construction has connections to the theory of chromatic numbers through the concept of k-constructible graphs. The construction is named after Hungarian mathematician György Hajós.
For more information, see these links:
https://en.wikipedia.org/wiki/Haj%C3%...
https://math.stackexchange.com/questi...
https://link.springer.com/chapter/10....