Pages that link to "Item:Q4604645"

The following pages link to The Geodetic Hull Number is Hard for Chordal Graphs (Q4604645):

Displaying 10 items.

• 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)
• Computing the hull number in toll convexity (Q2159554) (← links)
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
• Computing the hull number in \(\Delta \)-convexity (Q2205950) (← links)
• A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
• Parameterized Complexity of Geodetic Set (Q5050005) (← links)
• Hull and geodetic numbers for some classes of oriented graphs (Q5918550) (← links)
• Hull and geodetic numbers for some classes of oriented graphs (Q5918666) (← links)
• Parameterized Complexity of Geodetic Set (Q6089667) (← links)