Christophe Ndjatchi

activity

20102025

collaborators

3 papers

math.CO2025

Mutual-visibility of the disjointness graph of segments in $R^{2}$

J. Leaños, M. Lomelí-Haro, Christophe Ndjatchi +1

Let $G = (V (G), E (G))$ be a simple graph, and let $U \subseteq V (G)$ . Two distinct vertices $x, y \in U$ are $U$ -mutually visible if $G$ contains a shortest $x$ - $y$ path that is internal…

math.CO2023

Disjointness Graphs of segments in $R^{2}$ are almost all Hamiltonian

J. Leaños, Christophe Ndjatchi, L. M. Ríos-Castro

Let $P$ be a set of $n \geq 2$ points in general position in $R^{2}$ . The edge disjointness graph $D (P)$ of $P$ is the graph whose vertices are all the closed straight line segments w…

math.CO2010

Simple Euclidean arrangements with one (>=5)-gon

Jesus Leaños, Mbe Koua Christophe Ndjatchi, Luis Manuel Rivera-Martinez

Let L be a simple Euclidean arrangement of n pseudolines. It is shown that if L has exactly one (>=5)=gon P, and k is the number of edges of P that are adjacent to an unbounded cel…

Mutual-visibility of the disjointness graph of segments in R2

Disjointness Graphs of segments in R2 are almost all Hamiltonian

Simple Euclidean arrangements with one (>=5)-gon

Mutual-visibility of the disjointness graph of segments in $R^{2}$

Disjointness Graphs of segments in $R^{2}$ are almost all Hamiltonian