Pages that link to "Item:Q987671"

The following pages link to Complexity results related to monophonic convexity (Q987671):

Displaying 50 items.

• Complexity aspects of the triangle path convexity (Q277613) (← links)
• Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
• On the Carathéodory number of interval and graph convexities (Q392186) (← links)
• Graphs with a minimal number of convex sets (Q489304) (← links)
• Inapproximability results related to monophonic convexity (Q499364) (← links)
• On finite convexity spaces induced by sets of paths in graphs (Q533760) (← links)
• Complexity aspects of \(\ell\)-chord convexities (Q777442) (← 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)
• 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)
• The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
• Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) (← links)
• Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
• Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
• On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
• The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
• Convex geometries over induced paths with bounded length (Q2092354) (← links)
• A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
• On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
• \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
• A general framework for path convexities (Q2156285) (← 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)
• 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)
• Partitioning a graph into convex sets (Q2275456) (← links)
• Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
• Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232) (← links)
• The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
• On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
• Extreme-support total monophonic graphs (Q2666383) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• Geodetic convexity and Kneser graphs (Q2698271) (← links)
• (Q2857327) (← links)
• Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
• Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
• (Q5050650) (← links)
• (Q5061365) (← links)
• Minimal connected restrained monophonic sets in graphs (Q5866632) (← links)
• Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)
• On the monophonic rank of a graph (Q6045452) (← links)
• (Q6101492) (← links)
• Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
• On the monophonic convexity in complementary prisms (Q6140247) (← links)
• On monophonic position sets in graphs (Q6558674) (← links)
• Characterizations of graph classes via convex geometries: a survey (Q6648266) (← links)