Pages that link to "Item:Q5891860"

The following pages link to Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5891860):

Displaying 8 items.

• On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
• Convexity in partial cubes: the hull number (Q898152) (← links)
• Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
• A general framework for path convexities (Q2156285) (← links)
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← 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)