All-path convexity: two characterizations, general position number, and one algorithm
From MaRDI portal
Publication:6561583
Recommendations
Cites work
- A Characterization of Block-Graphs
- A general position problem in graph theory
- All-path convexity: combinatorial and complexity aspects.
- Characterization of classes of graphs with large general position number
- Convex sets in a graph
- Depth-First Search and Linear Graph Algorithms
- Distance-hereditary graphs
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On monophonic position sets in graphs
- On the general position number of two classes of graphs
- On the general position problem on Kneser graphs
- The All-Paths Transit Function of a Graph
- Tolerant Radon partitions on the all-paths convexity in graphs
This page was built for publication: All-path convexity: two characterizations, general position number, and one algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561583)