On the Carathéodory number for the convexity of paths of order three

DOI10.1137/110828678MaRDI QIDQ4899035zbMATH OpenOpenAlexFDO

Authors Erika M. M. Coelho, Mitre C. Dourado, Dieter Rautenbach, Rommel Barbosa, Jayme L. 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

zbMATH Keywords

\(P_3\) convexityCarathéodory numberconvexity spacegeodetic convexitymonophonic convexity

Mathematics Subject Classification ID

Graph theory (05C99) Other problems of combinatorial convexity (52A37)

Recommendations

• On the Carathéodory number for the convexity of paths of order three
• The Carathéodory number of the P₃ convexity of chordal graphs
• The Carathéodory number of the \(P_3\) convexity of chordal graphs
• The convexity of induced paths of order three and applications: complexity aspects
• An upper bound on the \(P_3\)-Radon number

Cited in

(32)

• 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
• The maximum time of 2-neighbor bootstrap percolation: complexity results
• The convexity of induced paths of order three and applications: complexity aspects
• Characterization and recognition of Radon-independent sets in split graphs
• On the \(P_3\)-hull number of Kneser graphs
• On the P₃-hull number of Hamming graphs
• On the parameterized complexity of the geodesic hull number
• On the Carathéodory and exchange numbers of geodetic convexity in graphs
• The Carathéodory number of the \(P_3\) convexity of chordal graphs
• Domination and convexity problems in the target set selection model
• Complexity aspects of the triangle path convexity
• On the Carathéodory number for the convexity of paths of order three
• On the Radon number for \(P _{3}\)-convexity
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• Convex independence in permutation graphs
• Complexity of determining the maximum infection time in the geodetic convexity
• Algorithmic and structural aspects of the P₃-Radon number
• On the Carathéodory number of interval and graph convexities
• Graphs with few \(P_4\)'s under the convexity of paths of order three
• Inapproximability results for graph convexity parameters
• Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
• Complexity properties of complementary prisms
• The Carathéodory number of the P₃ convexity of chordal graphs
• Target set selection with maximum activation time
• Carathéodory number of P₃-convexity of claw-free graphs
• Bounds on the P₃-Carathéodory number
• Graph convexity partizan games: complexity and winning strategies
• Algorithms and complexity of graph convexity partizan games
• The iteration time and the general position number in graph convexities
• On the hull and interval numbers of oriented graphs
• The maximum infection time in the geodesic and monophonic convexities

This page was built for publication: On the Carathéodory number for the convexity of paths of order three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899035)