\(P_3\)-hull number of graphs with diameter two

DOI10.1016/j.entcs.2019.08.028OpenAlexW2978435186WikidataQ113317404 ScholiaQ113317404MaRDI QIDQ2132359

Márcia R. Cappelle, Braully R. Silva, Hebert Coelho, Erika M. M. Coelho, Fábio Protti, Uéverton S. Souza

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.028

zbMATH Keywords

graphhull number\(P_3\)-convexitydiameter two

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (4)

A general framework for path convexities ⋮ 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 ⋮ Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms

Uses Software

• House of Graphs

Cites Work

• Complexity aspects of the triangle path convexity
• On the Carathéodory number of interval and graph convexities
• Inapproximability results related to monophonic convexity
• Complexity properties of complementary prisms
• Irreversible conversion of graphs
• On geodetic sets formed by boundary vertices
• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
• Complexity results related to monophonic convexity
• On the computation of the hull number of a graph
• The hull number of a graph
• Convex sets in graphs. II: Minimal path convexity
• On triangle path convexity in graphs
• Triangle-free graphs and forbidden subgraphs
• House of Graphs: a database of interesting graphs
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• On the hull number of some graph classes
• The Carathéodory number of the \(P_3\) convexity of chordal graphs
• On the geodetic hull number of \(P_{k}\)-free graphs
• Geodetic Number versus Hull Number in $P_3$-Convexity
• On the Hull Number of Triangle-Free Graphs
• On Moore Graphs with Diameters 2 and 3
• Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs

This page was built for publication: \(P_3\)-hull number of graphs with diameter two