Complexity aspects of \(\ell\)-chord convexities

DOI10.1016/j.dam.2020.04.022zbMath1443.05175OpenAlexW3023840851MaRDI QIDQ777442

Rodolfo A. de Oliveira, Mitre C. Dourado

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.022

zbMATH Keywords

convex hullinterval numbertriangle path convexitymonophonic convexity

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity aspects of the triangle path convexity
• Chordless paths through three vertices
• Complexity results related to monophonic convexity
• On the computation of the hull number of a graph
• Convex sets in graphs. II: Minimal path convexity
• On triangle path convexity in graphs
• Solving the 2-disjoint paths problem in nearly linear time
• Geodesic Convexity in Graphs

This page was built for publication: Complexity aspects of \(\ell\)-chord convexities