most citedModularity of minor-free graphs

5 citations

researchers with a paper here
collaborating institutions

5 papers

cs.AI2021★ 4 cited

Planning with Biological Neurons and Synapses

Francesco d'Amore, Daniel Mitropolsky, Pierluigi Crescenzi +2

We revisit the planning problem in the blocks world, and we implement a known heuristic for this task. Importantly, our implementation is biologically plausible, in the sense that…

cs.DM2021

Hyperbolicity Computation through Dominating Sets

David Coudert, André Nusser, Laurent Viennot

Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning…

cs.DM2021

Generalising the achromatic number to Zaslavsky's colourings of signed graphs

Julien Bensmail, François Dross, Nacim Oijid +1

The chromatic number, which refers to the minimum number of colours required to colour the vertices of graphs properly, is one of the most central notions of the graph chromatic th…

cs.DM2021

A proof of the Multiplicative 1-2-3 Conjecture

Julien Bensmail, Hervé Hocquard, Dimitri Lajou +1

We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kazi{ó}w in 2012, is true. Namely, for every connected graph with order at least 3, we prove that we…

math.CO2021★ 5 cited

Modularity of minor-free graphs

Michał Lasoń, Małgorzata Sulkowska

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the numb…