We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges between the clusters, as it is motivated by some earlier observations, e.g. in the structure of networks in ecology and economics and by applications of discrete tomography. Mathematically special colorings and chromatic numbers of graphs are studied.
@article{arxiv.2103.08005,
title = {Graph clustering via generalized colorings},
author = {András London and Ryan R. Martin and András Pluhár},
journal= {arXiv preprint arXiv:2103.08005},
year = {2021}
}