Zobrazeno 1 - 10
of 2 679
pro vyhledávání: '"A Havet"'
Autor:
Aboulker, Pierre, Havet, Frédéric, Lochet, William, Lopes, Raul, Picasarri-Arrieta, Lucas, Rambaud, Clément
A class of acyclic digraphs $\mathscr{C}$ is linearly unavoidable if there exists a constant $c$ such that every digraph $D\in \mathscr{C}$ is contained in all tournaments of order $c\cdot |V(D)|$. The class of all acyclic digraphs is not linearly av
Externí odkaz:
http://arxiv.org/abs/2410.23566
In an oriented graph $\vec{G}$, the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endvertices in $X$. The inversion graph of a labelled graph $G$, denoted by ${\mathcal{I}}(G)$, is the graph whose v
Externí odkaz:
http://arxiv.org/abs/2405.04119
Let $D$ be a digraph. Its acyclic number $\vec{\alpha}(D)$ is the maximum order of an acyclic induced subdigraph and its dichromatic number $\vec{\chi}(D)$ is the least integer $k$ such that $V(D)$ can be partitioned into $k$ subsets inducing acyclic
Externí odkaz:
http://arxiv.org/abs/2403.02298
A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite. Further,
Externí odkaz:
http://arxiv.org/abs/2402.12014
The dichromatic number of a digraph is the minimum integer $k$ such that it admits a $k$-dicolouring, i.e. a partition of its vertices into $k$ acyclic subdigraphs. We say that a digraph $D$ is a super-orientation of an undirected graph $G$ if $G$ is
Externí odkaz:
http://arxiv.org/abs/2309.17385
Autor:
Misbaou Barry, Fatoumata Barry, Mesut Gun, Paul Padurean, Eric Havet, Bessem Gara Ali, Thierry Caus
Publikováno v:
Journal of Cardiothoracic Surgery, Vol 19, Iss 1, Pp 1-7 (2024)
Abstract Objective In our study, we aim to explore the structural differences between the aortic root and the pulmonary artery to better understand the process of pulmonary autograft dilatation during the Ross procedure. Materials and methods We stud
Externí odkaz:
https://doaj.org/article/66d6354efc394f9da63fac0e90977820
The dichromatic number $\vec{\chi}(D)$ of a digraph $D$ is the minimum number of colours needed to colour the vertices of a digraph such that each colour class induces an acyclic subdigraph. A digraph $D$ is $k$-dicritical if $\vec{\chi}(D) = k$ and
Externí odkaz:
http://arxiv.org/abs/2306.10784
The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists of reversing the direction of all arcs of $D\langle X\rangle$. We study $sinv'_k(D)$ (resp. $sinv_k(D)$) which is the minimum number of inversions needed to transform $D$ into a $
Externí odkaz:
http://arxiv.org/abs/2303.11719
Autor:
Bousquet, Nicolas, Havet, Frédéric, Nisse, Nicolas, Picasarri-Arrieta, Lucas, Reinald, Amadeus
Given two $k$-dicolourings of a digraph $D$, we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while maintaining a dicolouring at any step even for $k=2$ and for digraphs
Externí odkaz:
http://arxiv.org/abs/2301.03417
Autor:
Aubian, Guillaume, Havet, Frédéric, Hörsch, Florian, Klingelhoefer, Felix, Nisse, Nicolas, Rambaud, Clément, Vermande, Quentin
The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists in reversing the direction of all arcs of $D\langle X\rangle$. The {\it inversion number} of an oriented graph $D$, denoted by ${\rm inv}(D)$, is the minimum number of inversions
Externí odkaz:
http://arxiv.org/abs/2212.09188