eprintid: 221116
rev_number: 5
eprint_status: archive
userid: 958
dir: disk0/00/22/11/16
datestamp: 2025-07-15 11:11:26
lastmod: 2025-07-15 11:11:26
status_changed: 2025-07-15 11:11:26
type: article
metadata_visibility: show
contact_email: london@inf.u-szeged.hu
sword_depositor: 958
creators_name: London, András
creators_name: Martin, Ryan Robert
creators_name: Pluhár, András
creators_orcid: 0000-0003-1957-5368
creators_orcid: 0000-0003-0683-1414
creators_orcid: 0000-0001-6576-4202
corp_creators: Számítógépes Optimalizálás Tanszék SZTE / TTIK / INF SZOT [2016-]
title: Graph clustering via generalized colorings
ispublished: pub
subjects: QA
full_text_status: restricted
keywords: Graph clustering, Coloring, Special graphs, Nestedness
abstract: 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.
date: 2022
date_type: published
publication: THEORETICAL COMPUTER SCIENCE
volume: 918
pagerange: 94-104
id_number: MTMT:32818120 10.1016/j.tcs.2022.03.023
refereed: TRUE
issn: 0304-3975
official_url: https://doi.org/10.1016/j.tcs.2022.03.023
fp7_project: no
fp7_type: info:eu-repo/semantics/article
citation:   London, András and Martin, Ryan Robert and Pluhár, András  (2022) Graph clustering via generalized colorings.  THEORETICAL COMPUTER SCIENCE, 918.  pp. 94-104.  ISSN 0304-3975     
document_url: https://real.mtak.hu/221116/1/2103.08005v1.pdf