The Carathéodory number of the \(P_3\) convexity of chordal graphs

DOI10.1016/j.dam.2014.03.004zbMath1288.05050OpenAlexW1978824404MaRDI QIDQ2449132

Dieter Rautenbach, Mitre C. Dourado, Erika M. M. Coelho, Jayme Luiz Szwarcfiter

Publication date: 6 May 2014

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

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

zbMATH Keywords

Carathéodory number\(P_3\) convexity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On the computational complexity of the Helly number in the \(P_3\) and related convexities ⋮ \(P_3\)-hull number of graphs with diameter two ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ And/or-convexity: a graph convexity based on processes and deadlock models ⋮ On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products ⋮ Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ On the hull number on cycle convexity of graphs ⋮ Efficient realizations of closure systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreversible conversion of graphs
• On geodetic sets formed by boundary vertices
• Complexity results related to monophonic convexity
• The hull number of a graph
• On local convexity in graphs
• Convex sets in graphs. II: Minimal path convexity
• On triangle path convexity in graphs
• On two-path convexity in multipartite tournaments
• Embedding tournaments in simple tournaments
• Some remarks on simple tournaments
• The All-Paths Transit Function of a Graph
• On the Hull Number of Triangle-Free Graphs
• Convexity in Graphs and Hypergraphs
• On the Carathéodory Number for the Convexity of Paths of Order Three