Pages that link to "Item:Q1045055"

The following pages link to On the computation of the hull number of a graph (Q1045055):

Displaying 44 items.

• Complexity aspects of the triangle path convexity (Q277613) (← links)
• Hull number: \(P_5\)-free graphs and reduction rules (Q299077) (← links)
• Geodeticity of the contour of chordal bipartite graphs (Q324794) (← links)
• Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
• Graphs with a minimal number of convex sets (Q489304) (← links)
• On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
• Towards a new framework for domination (Q651449) (← links)
• Complexity aspects of \(\ell\)-chord convexities (Q777442) (← links)
• The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
• Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
• On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
• Convexity in partial cubes: the hull number (Q898152) (← links)
• Complexity results related to monophonic convexity (Q987671) (← links)
• On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
• And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
• On the contour of bipartite graphs (Q1752491) (← links)
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
• Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
• The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
• On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs (Q2096273) (← links)
• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
• A general framework for path convexities (Q2156285) (← links)
• Computing the hull number in toll convexity (Q2159554) (← links)
• On the toll number of a graph (Q2172405) (← links)
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
• On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent (Q2192072) (← links)
• Computing the hull number in \(\Delta \)-convexity (Q2205950) (← links)
• On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
• Partitioning a graph into convex sets (Q2275456) (← links)
• Vector domination in split-indifference graphs (Q2281167) (← links)
• On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
• On the spectrum and number of convex sets in graphs (Q2339431) (← links)
• The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
• On the contour of graphs (Q2446313) (← links)
• On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
• Geodetic convexity and Kneser graphs (Q2698271) (← links)
• On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
• (Q2857318) (← links)
• Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
• THE HULL NUMBER OF POWERS OF CYCLES (Q4605408) (← links)
• A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
• Maximal closed set and half-space separations in finite closure systems (Q6093588) (← links)
• Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)