Pages that link to "Item:Q1120125"

The following pages link to Convex sets in graphs. II: Minimal path convexity (Q1120125):

Displayed 50 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)
• Equivalence between hypergraph convexities (Q410668) ‎ (← links)
• The pre-hull number and lexicographic product (Q432717) ‎ (← links)
• An upper bound on the \(P_3\)-Radon number (Q442343) ‎ (← links)
• On the geodeticity of the contour of a graph (Q479045) ‎ (← links)
• Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) ‎ (← links)
• Inapproximability results related to monophonic convexity (Q499364) ‎ (← links)
• On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) ‎ (← links)
• On finite convexity spaces induced by sets of paths in graphs (Q533760) ‎ (← links)
• Strict betweennesses induced by posets as well as by graphs (Q633221) ‎ (← links)
• Convex sets in lexicographic products of graphs (Q659762) ‎ (← links)
• The induced path transit function and the Pasch axiom (Q726505) ‎ (← links)
• Complexity aspects of \(\ell\)-chord convexities (Q777442) ‎ (← links)
• The maximum infection time in the geodesic and monophonic convexities (Q897893) ‎ (← links)
• On the geodetic iteration number of distance-hereditary graphs (Q898096) ‎ (← links)
• The induced path function, monotonicity and betweenness (Q968160) ‎ (← links)
• Complexity results related to monophonic convexity (Q987671) ‎ (← links)
• Triangle path transit functions, betweenness and pseudo-modular graphs (Q1024473) ‎ (← links)
• Canonical and monophonic convexities in hypergraphs (Q1043946) ‎ (← links)
• On local convexity in graphs (Q1089354) ‎ (← links)
• Bridged graphs and geodesic convexity (Q1106237) ‎ (← links)
• A Radon theorem for Helly graphs (Q1123404) ‎ (← links)
• A Helly theorem in weakly modular space (Q1126279) ‎ (← 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)
• A note on the interval function of a disconnected graph (Q1692623) ‎ (← links)
• Convexities related to path properties on graphs (Q1772411) ‎ (← links)
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) ‎ (← links)
• Intersecting sets in midset spaces. I (Q1842016) ‎ (← links)
• Induced path transit function, monotone and Peano axioms (Q1887635) ‎ (← links)
• A Helly theorem for geodesic convexity in strongly dismantlable graphs (Q1893169) ‎ (← links)
• Tverberg numbers for cellular bipartite graphs (Q1924906) ‎ (← links)
• Characterization and recognition of Radon-independent sets in split graphs (Q1941699) ‎ (← links)
• Computing simple-path convex hulls in hypergraphs (Q1944079) ‎ (← 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)
• 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)
• \(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 \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) ‎ (← 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)
• Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations (Q2181243) ‎ (← links)