Zobrazeno 1 - 10
of 153
pro vyhledávání: '"Pinlou, Alexandre"'
Autor:
Jacques, Fabien, Pinlou, Alexandre
A signed graph is a simple graph with two types of edges: positive and negative edges. Switching a vertex $v$ of a signed graph corresponds to changing the type of each edge incident to $v$. A homomorphism from a signed graph $G$ to another signed gr
Externí odkaz:
http://arxiv.org/abs/2104.11121
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an edge of t
Externí odkaz:
http://arxiv.org/abs/2009.05439
Publikováno v:
In Discrete Mathematics October 2023 346(10)
We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
Comment: 6 pages
Comment: 6 pages
Externí odkaz:
http://arxiv.org/abs/1908.11749
Autor:
Ochem, Pascal, Pinlou, Alexandre
Duffy et al. [C. Duffy, G. MacGillivray, and \'E. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently considered the oriented chromatic number of connected oriented graph
Externí odkaz:
http://arxiv.org/abs/1905.12484
A $d$-subsequence of a sequence $\varphi = x_1\dots x_n$ is a subsequence $x_i x_{i+d} x_{i+2d} \dots$, for any positive integer $d$ and any $i$, $1 \le i \le n$. A \textit{$k$-Thue sequence} is a sequence in which every $d$-subsequence, for $1 \le d
Externí odkaz:
http://arxiv.org/abs/1810.01210
Autor:
Jacques, Fabien, Pinlou, Alexandre
Publikováno v:
In Discrete Applied Mathematics 31 July 2022 316:43-59
We prove that every triangle-free planar graph of order $n$ and size $m$ has an induced linear forest with at least $\frac{9n - 2m}{11}$ vertices, and thus at least $\frac{5n + 8}{11}$ vertices. Furthermore, we show that there are triangle-free plana
Externí odkaz:
http://arxiv.org/abs/1705.11133
Publikováno v:
Electron J. Combin. 25 (2018), #P1.61
The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph classes. In th
Externí odkaz:
http://arxiv.org/abs/1702.01058
An $({\cal I},{\cal F}_d)$-partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$, such that $I$ is an independent set and $F$ induces a forest of maximum degree at most $d$. We show that for all $M<3$ and $d \ge \
Externí odkaz:
http://arxiv.org/abs/1606.04394