On the Carathéodory Number for the Convexity of Paths of Order Three
From MaRDI portal
Publication:4899035
DOI10.1137/110828678zbMath1256.05240OpenAlexW2082103047MaRDI QIDQ4899035
Mitre C. Dourado, Erika M. M. Coelho, Dieter Rautenbach, Rommel M. Barbosa, Jayme Luiz Szwarcfiter
Publication date: 4 January 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110828678
Related Items
Complexity aspects of the triangle path convexity, The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree, On the \(P_3\)-hull number of some products of graphs, Complexity of determining the maximum infection time in the geodetic convexity, Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs, Algorithmic and structural aspects of the \(P_3\)-Radon number, The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results, On the Carathéodory number of interval and graph convexities, On the \(P_3\)-hull number of Hamming graphs, The maximum time of 2-neighbor bootstrap percolation: complexity results, Target set selection with maximum activation time, Convex Independence in Permutation Graphs, The maximum infection time in the geodesic and monophonic convexities, Characterization and recognition of Radon-independent sets in split graphs, Domination and convexity problems in the target set selection model, The convexity of induced paths of order three and applications: complexity aspects, The Carathéodory number of the \(P_3\) convexity of chordal graphs, Graphs with few \(P_4\)'s under the convexity of paths of order three, Inapproximability results for graph convexity parameters, Complexity properties of complementary prisms, On the parameterized complexity of the geodesic hull number, On the Carathéodory and exchange numbers of geodetic convexity in graphs, On the \(P_3\)-hull number of Kneser graphs
