Graph clustering via generalized colorings

DOI10.1016/j.tcs.2022.03.023OpenAlexW3136280403MaRDI QIDQ2136276

András London, András Pluhár, Ryan R. Martin

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.08005

zbMATH Keywords

coloringnestednessgraph clusteringspecial graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph clustering
• Characterization of forbidden subgraphs for bounded star chromatic number
• Cliques in random graphs
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• An upper bound on the number of cliques in a graph
• Difference graphs
• The chromatic number of random graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph clustering via generalized colorings