Weakly toll convexity and proper interval graphs

DOI10.46298/dmtcs.9837zbMath1547.05062MaRDI QIDQ6606986

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

Publication date: 17 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

convexityproper interval graphconvex geometryweakly toll walk

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) General convexity (52A99)

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• End vertices in interval graphs
• Convex sets in graphs. II: Minimal path convexity
• A characterisation of rigid circuit graphs
• Convex geometries over induced paths with bounded length
• Toll convexity
• Incidence matrices and interval graphs
• Steiner distance and convexity in graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Geodesic Convexity in Graphs
• Representation of a finite graph by a set of intervals on the real line
• Convexity in Graphs and Hypergraphs
• Convexity and HHD-Free Graphs
• On extreme points of regular convex sets

Related Items (1)

Characterizations of graph classes via convex geometries: a survey

This page was built for publication: Weakly toll convexity and proper interval graphs