Pages that link to "Item:Q3718757"
From MaRDI portal
The following pages link to Convexity in Graphs and Hypergraphs (Q3718757):
Displaying 50 items.
- On the contour of bipartite graphs (Q1752491) (← links)
- Closure spaces that are not uniquely generated (Q1766744) (← links)
- Convexities related to path properties on graphs (Q1772411) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Perfect elimination orderings of chordal powers of graphs (Q1815326) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Induced path transit function, monotone and Peano axioms (Q1887635) (← links)
- The structure of the centroid in a Ptolemaic graph (Q1893686) (← links)
- Closure lattices (Q1918553) (← links)
- On the convexity number of graphs (Q1926045) (← 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)
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← links)
- Toll number of the Cartesian and the lexicographic product of graphs (Q2012538) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- Characterizations of \(L\)-convex spaces via domain theory (Q2036808) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Convex and quasiconvex functions in metric graphs (Q2070539) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Computing the hull number in toll convexity (Q2159554) (← links)
- A note on the convexity number of the complementary prisms of trees (Q2161269) (← links)
- On the toll number of a graph (Q2172405) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← 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)
- Toll convexity (Q2255809) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Characterizations of convex spaces and anti-matroids via derived operators (Q2278365) (← links)
- Lattice-equivalence of convex spaces (Q2311873) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- Computational processes that appear to model human memory (Q2364899) (← links)
- Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232) (← links)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- On the contour of graphs (Q2446313) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- Geodeticity of the contour of chordal graphs (Q2482108) (← links)
- Decomposability of abstract and path-induced convexities in hypergraphs (Q2516676) (← links)
- Oracles for vertex elimination orderings (Q2566003) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
