output
20082021
most citedOn a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture

22 citations

Showing math.COShow all

7 papers · 1 filter

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…

math.CO2017

Computing metric hulls in graphs

Kolja Knauer, Nicolas Nisse

We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Alben…

math.CO2017★ 22 cited

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture

Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie

This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights to the edges of any given graph (with no comp…

math.CO2016★ 16 cited

A Variant of the Erdős-Sós Conjecture

Frédéric Havet, Bruce Reed, Maya Stein +1

A well-known conjecture of Erdős and Sós states that every graph with average degree exceeding contains every tree with edges as a subgraph. We propose a variant of this…

math.CO2016★ 18 cited

How to determine if a random graph with a fixed degree sequence has a giant component

Felix Joos, Guillem Perarnau, Dieter Rautenbach +1

For a fixed degree sequence , let be a uniformly chosen (simple) graph on where the vertex has degree . In this p…

math.CO2015★ 13 cited

Colouring graphs with constraints on connectivity

Pierre Aboulker, Nick Brettell, Frédéric Havet +2

A graph has maximal local edge-connectivity if the maximum number of edge-disjoint paths between every pair of distinct vertices and is at most . We prove Brooks…

math.CO2008★ 7 cited

List Colouring Squares of Planar Graphs

Frédéric Havet, Jan van den Heuvel, Colin McDiarmid +1

In 1977, Wegner conjectured that the chromatic number of the square of every planar graph with maximum degree is at most . We show t…