Pages that link to "Item:Q1939271"

The following pages link to On the hull number of some graph classes (Q1939271):

Displaying 22 items.

• Hull number: \(P_5\)-free graphs and reduction rules (Q299077) (← links)
• Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
• Convexity in partial cubes: the hull number (Q898152) (← links)
• And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
• The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← 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)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← 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)
• The strong convexity spectra of grids (Q2409510) (← links)
• The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
• On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
• Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← 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)
• Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← 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)
• Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)