Weakly toll convexity and proper interval graphs
From MaRDI portal
Publication:6606986
Recommendations
Cites work
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- Convex geometries over induced paths with bounded length
- Convex sets in graphs. II: Minimal path convexity
- Convexity and HHD-Free Graphs
- Convexity in Graphs and Hypergraphs
- End vertices in interval graphs
- Geodesic Convexity in Graphs
- Incidence matrices and interval graphs
- On extreme points of regular convex sets
- On rigid circuit graphs
- Representation of a finite graph by a set of intervals on the real line
- Steiner distance and convexity in graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Toll convexity
Cited in
(2)
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)