Pages that link to "Item:Q4899035"

The following pages link to On the Carathéodory Number for the Convexity of Paths of Order Three (Q4899035):

Displaying 23 items.

• Complexity aspects of the triangle path convexity (Q277613) (← links)
• Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
• Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
• On the Carathéodory number of interval and graph convexities (Q392186) (← links)
• Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
• Inapproximability results for graph convexity parameters (Q496002) (← links)
• Complexity properties of complementary prisms (Q511681) (← 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 maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
• The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
• Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
• On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
• On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
• On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
• On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
• The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205) (← links)
• Convex Independence in Permutation Graphs (Q2958358) (← links)
• Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)