Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Cizma, Daniel"'
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths defined by assi
Externí odkaz:
http://arxiv.org/abs/2311.09364
Autor:
Cizma, Daniel, Linial, Nati
A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V= A\sqcup B$ such that $\mathcal{P}$ restricts to a path system on both $G[A]$ and $G[B]$. In this paper, we construct an infinite family
Externí odkaz:
http://arxiv.org/abs/2104.08770
Autor:
Cizma, Daniel, Linial, Nati
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices $y, z$ ar
Externí odkaz:
http://arxiv.org/abs/2007.13782
Autor:
Cizma, Daniel1 (AUTHOR) daniel.cizma@mail.huji.ac.il, Linial, Nati2 (AUTHOR)
Publikováno v:
Journal of Graph Theory. Jan2023, Vol. 102 Issue 1, p5-14. 10p.
Autor:
Cizma, Daniel, Linial, Nati
Publikováno v:
Discrete & Computational Geometry. 68:298-347
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices $y, z$ ar
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.