AI Chat AI Image Generator AI Video Text to Speech

Heroes in orientations of chordal graphs

02/18/2022

∙

by Pierre Aboulker, et al.

∙

∙

We characterize all digraphs H such that orientations of chordal graphs with no induced copy of H have bounded dichromatic number.

Pierre Aboulker
16 publications
Guillaume Aubian
7 publications
Raphael Steiner
18 publications

page 1

page 2

page 3

page 4

research

∙ 12/15/2018

Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs

It is known that the class of all graphs not containing a graph H as an ...

0 Masood Masjoody, et al. ∙

research

∙ 03/07/2019

Well-indumatched Trees and Graphs of Bounded Girth

A graph G is called well-indumatched if all of its maximal induced match...

0 S. Akbari, et al. ∙

research

∙ 03/06/2018

Induced and Weak Induced Arboricities

We define the induced arboricity of a graph G, denoted by ia(G), as the...

0 Maria Axenovich, et al. ∙

research

∙ 07/08/2022

Copy Propagation subsumes Constant Propagation

Constant propagation and copy propagation are code transformations that ...

0 Sreekala S., et al. ∙

research

∙ 01/02/2020

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs

We describe algorithmic Number On the Forehead protocols that provide de...

0 Noga Alon, et al. ∙

research

∙ 02/05/2022

Exploring the Dynamics of the Circumcenter Map

Using experimental techniques, we study properties of the "circumcenter ...

0 Nicholas McDonald, et al. ∙

research

∙ 12/05/2019

Almost-monochromatic sets and the chromatic number of the plane

In a colouring of R^d a pair (S,s_0) with S⊆R^d and with s_0∈ S is almos...

0 Nóra Frankl, et al. ∙