Convexity in Graphs and Hypergraphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1743966
- scientific article; zbMATH DE number 4193691
- On the convexity number of graphs
- Convex set and hypergraphs
- scientific article; zbMATH DE number 3880749
- The convexity spectra of graphs
- scientific article; zbMATH DE number 3880762
- Convexity in oriented graphs
- scientific article; zbMATH DE number 1439489
- scientific article; zbMATH DE number 54803
Cites work
- A characterization of ptolemaic graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Balanced matrices
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Combinatorial Configurations
- Domination, independent domination, and duality in strongly chordal graphs
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- Graph theory with applications
- scientific article; zbMATH DE number 3880762 (Why is no real title available?)
- scientific article; zbMATH DE number 3683635 (Why is no real title available?)
- scientific article; zbMATH DE number 3724452 (Why is no real title available?)
- scientific article; zbMATH DE number 3757213 (Why is no real title available?)
- scientific article; zbMATH DE number 3779384 (Why is no real title available?)
- scientific article; zbMATH DE number 3498608 (Why is no real title available?)
- scientific article; zbMATH DE number 3211481 (Why is no real title available?)
- Independent domination in chordal graphs
- Meet-distributive lattices and the anti-exchange closure
- On rigid circuit graphs
- On the Desirability of Acyclic Database Schemes
- Path Partitions in Directed Graphs
- Solving covering problems and the uncapacitated plant location problem on trees
- Steiner trees, connected domination and strongly chordal graphs
- Tietze's convexity theorem for semilattices and lattices
- Totally-Balanced and Greedy Matrices
- Triangulated graphs and the elimination process
Cited in
(only showing first 100 items - show all)- Local Steiner convexity
- On the geodesic pre-hull number of a graph
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Canonical and monophonic convexities in hypergraphs
- On the computation of the hull number of a graph
- On 3-Steiner simplicial orderings
- A characterization of totally balanced hypergraphs
- On local convexity in graphs
- Bridged graphs and geodesic convexity
- On bridged graphs and cop-win graphs
- The center and the distance center of a Ptolemaic graph
- On diameters and radii of bridged graphs
- Some properties of graph centroids
- A convexity lemma and expansion procedures for bipartite graphs
- On triangle path convexity in graphs
- \(r\)-dominating cliques in graphs with hypertree structure
- LexBFS-orderings and powers of chordal graphs
- A monadic second-order definition of the structure of convex hypergraphs.
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- Closure systems and their structure
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree
- On the \(P_3\)-hull number of some products of graphs
- Convexity properties of the canonical S-graphs
- The maximum time of 2-neighbor bootstrap percolation: complexity results
- Toll number of the strong product of graphs
- On the contour of bipartite graphs
- Closure spaces that are not uniquely generated
- Convexities related to path properties on graphs
- On the Steiner, geodetic and hull numbers of graphs
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Perfect elimination orderings of chordal powers of graphs
- Consequences of an algorithm for bridged graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Induced path transit function, monotone and Peano axioms
- The structure of the centroid in a Ptolemaic graph
- Closure lattices
- On the convexity number of graphs
- Characterization and recognition of Radon-independent sets in split graphs
- Computing simple-path convex hulls in hypergraphs
- Decomposable convexities in graphs and hypergraphs
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
- Toll number of the Cartesian and the lexicographic product of graphs
- Geodetic convexity parameters for \((q, q - 4)\)-graphs
- Characterizations of \(L\)-convex spaces via domain theory
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Convex and quasiconvex functions in metric graphs
- Convex geometries over induced paths with bounded length
- Diameter estimates for graph associahedra
- Enumerating maximal consistent closed sets in closure systems
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- A necessary condition for the equality of the clique number and the convexity number of a graph
- Computing the hull number in toll convexity
- A note on the convexity number of the complementary prisms of trees
- On the toll number of a graph
- Perfect elimination orderings for symmetric matrices
- On the P₃-hull number of Hamming graphs
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- Toll convexity
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- On the parameterized complexity of the geodesic hull number
- Partitioning a graph into convex sets
- Characterizations of convex spaces and anti-matroids via derived operators
- Lattice-equivalence of convex spaces
- On the spectrum and number of convex sets in graphs
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
- Computational processes that appear to model human memory
- Inapproximability results and bounds for the Helly and Radon numbers of a graph
- Steiner distance and convexity in graphs
- On the contour of graphs
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- Geodeticity of the contour of chordal graphs
- Decomposability of abstract and path-induced convexities in hypergraphs
- Oracles for vertex elimination orderings
- Rebuilding convex sets in graphs
- On the geodetic hull number of \(P_{k}\)-free graphs
- Resolutions of convex geometries
- The contour of a bridged graph is geodetic
- Domination and convexity problems in the target set selection model
- The All-Paths Transit Function of a Graph
- The geometry of convex affine maximal graphs
- Complexity aspects of the triangle path convexity
- On the geodetic iteration number of the contour of a graph
- Minimum eccentricity shortest paths in some structured graph classes
- On the convexity of paths of length two in undirected graphs
- On the hull number of some graph classes
- 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
- Convex graph invariants
- The recognition of geodetically connected graphs
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
- Generating and enumerating digitally convex sets of trees
- Antimatroids, betweenness, convexity
- Finding a maximum-weight convex set in a chordal graph
- Geodetic convexity parameters for graphs with few short induced paths
- scientific article; zbMATH DE number 5139432 (Why is no real title available?)
- Some structural, metric and convex properties on the boundary of a graph
- Reconstructing trees from digitally convex sets
- Convex Partitions of Graphs
- Algorithmic Aspects of Monophonic Convexity
- Probe Ptolemaic Graphs
This page was built for publication: Convexity in Graphs and Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718757)
