Pages that link to "Item:Q1120125"

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

Displaying 46 items.

• \(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)
• On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
• On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent (Q2192072) (← links)
• Axiomatic characterization of the interval function of a bipartite graph (Q2201765) (← links)
• Toll convexity (Q2255809) (← 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)
• Covering graphs with convex sets and partitioning graphs into convex sets (Q2308465) (← links)
• Selfishness of convex bodies and discrete point sets (Q2311383) (← links)
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
• Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232) (← links)
• On two-path convexity in multipartite tournaments (Q2426441) (← links)
• On the contour of graphs (Q2446313) (← links)
• The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
• Decomposability of abstract and path-induced convexities in hypergraphs (Q2516676) (← links)
• On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• The All-Paths Transit Function of a Graph (Q2760973) (← links)
• Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs (Q2788726) (← links)
• Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions (Q2795939) (← links)
• On the convexity of paths of length two in undirected graphs (Q2839205) (← links)
• On the Carathéodory number for the convexity of paths of order three (Q2857327) (← links)
• Minimal trees and monophonic convexity (Q2866415) (← links)
• Some Steiner concepts on lexicographic products of graphs (Q2931926) (← links)
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205) (← links)
• Convex Independence in Permutation Graphs (Q2958358) (← links)
• Antimatroids, Betweenness, Convexity (Q2971604) (← links)
• Axiomatic Characterization of the Interval Function of a Bipartite Graph (Q2971638) (← links)
• Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
• Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
• Graphs with intrinsic s3 convexities (Q3824446) (← links)
• (Q4519720) (← links)
• Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
• CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
• On the monophonic rank of a graph (Q6045452) (← links)
• On the hull number on cycle convexity of graphs (Q6072203) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)
• Computing the hull and interval numbers in the weakly toll convexity (Q6131192) (← links)
• Segment transit function of the induced path function of graphs and its first-order definability (Q6132572) (← links)
• On the monophonic convexity in complementary prisms (Q6140247) (← links)
• Poidge-convexity in triangular lattices (Q6585516) (← links)
• Carathéodory number of \(P_3\)-convexity of claw-free graphs (Q6586574) (← links)
• Weakly toll convexity and proper interval graphs (Q6606986) (← links)
• Characterizations of graph classes via convex geometries: a survey (Q6648266) (← links)
• Tolerant Radon partitions on the all-paths convexity in graphs (Q6651150) (← links)