On triangle path convexity in graphs
From MaRDI portal
Recommendations
- Complexity aspects of the triangle path convexity
- Convexities related to path properties on graphs
- scientific article; zbMATH DE number 1743966
- Triangulability of convex graphs and convex skewness
- scientific article; zbMATH DE number 7528
- scientific article; zbMATH DE number 1539533
- On the convexity of paths of length two in undirected graphs
- scientific article; zbMATH DE number 4085714
- scientific article; zbMATH DE number 1347014
- Convexity in Graphs and Hypergraphs
Cited in
(58)- Triangle path transit functions, betweenness and pseudo-modular graphs
- Canonical and monophonic convexities in hypergraphs
- On the \(P_3\)-hull number of some products of graphs
- The convexity of induced paths of order three and applications: complexity aspects
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
- Convexities related to path properties on graphs
- Computing simple-path convex hulls in hypergraphs
- Decomposable convexities in graphs and hypergraphs
- Geodetic convexity parameters for \((q, q - 4)\)-graphs
- \(P_3\)-hull number of graphs with diameter two
- On the -interval and the -convexity numbers of graphs and graph products
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- Toll convexity
- Partitioning a graph into convex sets
- On the Carathéodory and exchange numbers of geodetic convexity in graphs
- Selfishness of convex bodies and discrete point sets
- Intervals and convex sets in strong product of graphs
- Axiomatic characterization of the interval function of a block graph
- On two-path convexity in multipartite tournaments
- On the contour of graphs
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- Decomposability of abstract and path-induced convexities in hypergraphs
- On the geodetic hull number of \(P_{k}\)-free graphs
- Domination and convexity problems in the target set selection model
- Complexity aspects of the triangle path convexity
- On the convexity of paths of length two in undirected graphs
- On the Carathéodory number for the convexity of paths of order three
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Some Steiner concepts on lexicographic products of graphs
- Geodetic convexity parameters for graphs with few short induced paths
- A note on path domination
- scientific article; zbMATH DE number 4085714 (Why is no real title available?)
- On the Carathéodory number of interval and graph convexities
- Equivalence between hypergraph convexities
- The pre-hull number and lexicographic product
- An upper bound on the \(P_3\)-Radon number
- scientific article; zbMATH DE number 1539533 (Why is no real title available?)
- Revisiting decomposition by clique separators
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs
- Tight paths in convex geometric hypergraphs
- On finite convexity spaces induced by sets of paths in graphs
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- Walk Domination and HHD-Free Graphs
- On the in-neighbor convexity
- Poidge-convexity in triangular lattices
- Carathéodory number of P₃-convexity of claw-free graphs
- Characterizations of graph classes via convex geometries: a survey
- Tolerant Radon partitions on the all-paths convexity in graphs
- First order non-definability of some transit functions on graphs
- Carathéodory number and exchange number in -convexity
- Graph convexity partizan games: complexity and winning strategies
- Algorithms and complexity of graph convexity partizan games
- Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs
- Tolerant Radon partitions of induced path convexity in graphs
- Half-space separation in monophonic convexity
- Complexity aspects of -chord convexities
- On geodetic sets formed by boundary vertices
This page was built for publication: On triangle path convexity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304810)
