Computing the hull and interval numbers in the weakly toll convexity

DOI10.1016/j.tcs.2024.114501arXiv2303.07414MaRDI QIDQ6131192

Marisa Gutierrez, Mitre C. Dourado, Silvia B. Tondato, Fábio Protti

Publication date: 4 April 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.07414

zbMATH Keywords

convexityconvex hullproper interval graphconvex geometryweakly toll walk

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexity in partial cubes: the hull number
• Some remarks on the geodetic number of a graph
• Complexity results related to monophonic convexity
• On the geodetic number and related metric sets in Cartesian product graphs
• On the computation of the hull number of a graph
• The hull number of a graph
• Weak bipolarizable graphs
• Convex sets in graphs. II: Minimal path convexity
• The geodetic number of a graph
• Convexities related to path properties on graphs
• On the hull number of some graph classes
• Computing the hull number in toll convexity
• On the toll number of a graph
• Toll convexity
• The geodetic number of the lexicographic product of graphs
• Optimal decomposition by clique separators
• Geodesic Convexity in Graphs
• Geodetic Sets in Graphs
• Convexity in Graphs and Hypergraphs
• Convexity and HHD-Free Graphs

This page was built for publication: Computing the hull and interval numbers in the weakly toll convexity