Pages that link to "Item:Q2629231"

The following pages link to On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231):

Displaying 17 items.

• On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
• On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
• On the geodetic number of complementary prisms (Q1721934) (← links)
• Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
• The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
• Delta invariant for Eulerian digraphs (Q2079872) (← links)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
• On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
• On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
• Computing the hull number in \(\Delta \)-convexity (Q2205950) (← links)
• On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
• The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
• The Geodetic Hull Number is Hard for Chordal Graphs (Q4604645) (← links)
• A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
• Parameterized Complexity of Geodetic Set (Q5050005) (← links)