Complexity aspects of the triangle path convexity
From MaRDI portal
Publication:277613
DOI10.1016/j.dam.2016.01.015zbMath1335.05045arXiv1503.00458OpenAlexW2113576864MaRDI QIDQ277613
Mitre C. Dourado, Rudini Menezes Sampaio
Publication date: 2 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.00458
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52B99)
Related Items (10)
\(P_3\)-hull number of graphs with diameter two ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ A general framework for path convexities ⋮ On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ Domination and convexity problems in the target set selection model ⋮ Computing the hull number in \(\Delta \)-convexity ⋮ Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach ⋮ On the Carathéodory and exchange numbers of geodetic convexity in graphs ⋮ Complexity aspects of \(\ell\)-chord convexities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound on the \(P_3\)-Radon number
- Inapproximability results related to monophonic convexity
- Irreversible conversion of graphs
- A Helly theorem for convexity in graphs
- Some remarks on the geodetic number of a graph
- Complexity results related to monophonic convexity
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- On the computation of the hull number of a graph
- Decomposition by clique separators
- The theory of convex geometries
- Bridged graphs and geodesic convexity
- Convex sets in graphs. II: Minimal path convexity
- On triangle path convexity in graphs
- Convexities related to path properties on graphs
- On the convexity number of graphs
- Open packing, total domination, and the \(P_3\)-Radon number
- Optimal decomposition by clique separators
- Geodesic Convexity in Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- Convexity in Graphs and Hypergraphs
- Graphs with intrinsic s3 convexities
- On the Carathéodory Number for the Convexity of Paths of Order Three
- Convexity in Partial Cubes: The Hull Number
This page was built for publication: Complexity aspects of the triangle path convexity
