2 papers
math.CO2021
Constructions of betweenness-uniform graphs from trees
David Hartman, Aneta Pokorná
Betweenness centrality is a measure of the importance of a vertex x inside a network based on the fraction of shortest paths passing through x. We study a blow-up construction that…
cs.DS2020
On 3-Coloring of -Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík +2
The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minim…