Weakly toll convexity and proper interval graphs

DOI10.46298/DMTCS.9837zbMATH Open1547.05062MaRDI QIDQ6606986FDOQ6606986

Authors: Mitre C. Dourado, M. Gutierrez, Fábio Protti, Silvia B. Tondato 

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

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

Cited In (1)

• Characterizations of graph classes via convex geometries: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606986)