Pages that link to "Item:Q1304810"
From MaRDI portal
The following pages link to On triangle path convexity in graphs (Q1304810):
Displaying 42 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- A note on path domination (Q339493) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- Equivalence between hypergraph convexities (Q410668) (← links)
- The pre-hull number and lexicographic product (Q432717) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- On finite convexity spaces induced by sets of paths in graphs (Q533760) (← links)
- Complexity aspects of \(\ell\)-chord convexities (Q777442) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- Triangle path transit functions, betweenness and pseudo-modular graphs (Q1024473) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) (← links)
- Convexities related to path properties on graphs (Q1772411) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- A general framework for path convexities (Q2156285) (← links)
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- Toll convexity (Q2255809) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- Selfishness of convex bodies and discrete point sets (Q2311383) (← links)
- Intervals and convex sets in strong product of graphs (Q2376077) (← links)
- Axiomatic characterization of the interval function of a block graph (Q2407023) (← links)
- On two-path convexity in multipartite tournaments (Q2426441) (← links)
- On the contour of graphs (Q2446313) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- Decomposability of abstract and path-induced convexities in hypergraphs (Q2516676) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
- (Q2857327) (← links)
- Some Steiner concepts on lexicographic products of graphs (Q2931926) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)
- Walk Domination and HHD-Free Graphs (Q6489357) (← links)
