Weakly toll convexity and proper interval graphs

A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \in S$ any vertex in a weakly toll walk between $x$...

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 26:2; no. Graph Theory; pp. 1 - 16
Main Authors:	Dourado, Mitre C., Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.08.2024 Discrete Mathematics & Theoretical Computer Science
Subjects:	05c75 Analysis Apexes computer science - discrete mathematics Convex sets Convexity Differential geometry Graph theory Graphs Invariants mathematics - combinatorics Trees (mathematics) Brazil
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!