output
20192026
most citedUnraveling the Hidden Environmental Impacts of AI Solutions for Environment

180 citations

researchers with a paper here
collaborating institutions
Showing math.COShow all

19 papers · 1 filter

math.CO2025

New bounds for proper -conflict-free colourings

Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang +1

A proper -colouring of a graph is called -conflict-free if every vertex has at least colours appearing exactly once in its neighbourhood.…

math.CO2024

Partitions of planar (oriented) graphs into a connected acyclic and an independent set

Stijn Cambie, François Dross, Kolja Knauer +2

A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyc…

math.CO2024

A conjecture on descents, inversions and the weak order

Christophe Hohlweg, Viviane Pons

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system : a partition of an element is a subset such that…

math.CO2024

Weak coloring numbers of minor-closed graph classes

Jędrzej Hodor, Hoang La, Piotr Micek +1

We study the growth rate of weak coloring numbers of graphs excluding a fixed graph as a minor. Van den Heuvel et al. (European J. of Combinatorics, 2017) showed that for a fixed g…

math.CO2024

Power Quotients of Plactic-like Monoids

Antoine Abram, Florent Hivert, James D. Mitchell +2

In this paper we describe the quotients of several plactic-like monoids by the least congruences containing the relations with for every generator . T…

math.CO2024

Quickly excluding an apex-forest

Jędrzej Hodor, Hoang La, Piotr Micek +1

We give a short proof that for every apex-forest on at least two vertices, graphs excluding as a minor have layered pathwidth at most . This improves upon a resu…