On the monophonic rank of a graph
A set of vertices $S$ of a graph $G$ is {\em monophonically convex} if every induced path joining two vertices of $S$ is contained in $S$. The {\em monophonic convex hull of $S$}, $\langle S \rangle$, is the smallest monophonically convex set containing $S$. A set $S$ is {\em monophonic convexly ind...
| Prif Awduron: | , , |
|---|---|
| Fformat: | Erthygl |
| Iaith: | English |
| Cyhoeddwyd: |
Discrete Mathematics & Theoretical Computer Science
2022-09-01
|
| Cyfres: | Discrete Mathematics & Theoretical Computer Science |
| Pynciau: | |
| Mynediad Ar-lein: | https://dmtcs.episciences.org/6835/pdf |