Pages that link to "Item:Q499364"

The following pages link to Inapproximability results related to monophonic convexity (Q499364):

Displaying 16 items.

• Complexity aspects of the triangle path convexity (Q277613) (← links)
• The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
• The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
• On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
• A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
• Extreme-support total monophonic graphs (Q2666383) (← links)
• (Q5050650) (← links)
• (Q5061365) (← links)
• Minimal connected restrained monophonic sets in graphs (Q5866632) (← links)
• Preface (Q5965755) (← links)
• (Q6101492) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)
• On the monophonic convexity in complementary prisms (Q6140247) (← links)