Pages that link to "Item:Q3718757"
From MaRDI portal
The following pages link to Convexity in Graphs and Hypergraphs (Q3718757):
Displaying 50 items.
- The contour of a bridged graph is geodetic (Q266844) (← links)
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- On the geodetic iteration number of the contour of a graph (Q277655) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- Reconstructing trees from digitally convex sets (Q344865) (← 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 a minimal number of convex sets (Q489304) (← links)
- A convex polytope and an antimatroid for any given, finite group (Q510527) (← links)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (Q534056) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
- Peakless functions on graphs (Q678883) (← links)
- Separation properties of 3-Steiner and 3-monophonic convexity in graphs (Q713150) (← links)
- Special eccentric vertices for the class of chordal graphs and related classes (Q742574) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- Local Steiner convexity (Q1024317) (← links)
- On the geodesic pre-hull number of a graph (Q1024319) (← links)
- Triangle path transit functions, betweenness and pseudo-modular graphs (Q1024473) (← links)
- Canonical and monophonic convexities in hypergraphs (Q1043946) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- On 3-Steiner simplicial orderings (Q1045119) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- On local convexity in graphs (Q1089354) (← links)
- Bridged graphs and geodesic convexity (Q1106237) (← links)
- On bridged graphs and cop-win graphs (Q1108291) (← links)
- The center and the distance center of a Ptolemaic graph (Q1112843) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- Some properties of graph centroids (Q1179740) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- LexBFS-orderings and powers of chordal graphs (Q1363684) (← links)
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches. (Q1406042) (← links)
- Closure systems and their structure (Q1602560) (← 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)
- Toll number of the strong product of graphs (Q1712528) (← links)
