Convexity in partial cubes: the hull number
DOI10.1016/J.DISC.2015.10.032zbMATH Open1327.05086OpenAlexW2463927641MaRDI QIDQ898152FDOQ898152
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.032
Recommendations
hull numberpartial cubealgorithmic complexityposet dimensiontopological representationupper locally distributive lattice
Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Lectures on Polytopes
- Oriented Matroids
- Two poset polytopes
- On the Addressing Problem for Loop Switching
- Title not available (Why is that?)
- On the complexity of \(k\)-SAT
- Convex excess in partial cubes
- Media theory. Interdisciplinary applied mathematics.
- Antipodal graphs and oriented matroids
- A use for frequently rediscovering a concept
- Isometric embedding in products of complete graphs
- On the computation of the hull number of a graph
- Topes of oriented matroids and related structures
- Distance-preserving subgraphs of hypercubes
- The Complexity of the Partial Order Dimension Problem
- Graphs with intrinsic s3 convexities
- Title not available (Why is that?)
- The hull number of a graph
- On the hull number of some graph classes
- On the Hull Number of Triangle-Free Graphs
- On the geodetic and the hull numbers in strong product graphs
- Lattices with unique irreducible decompositions
- Optimal packing and covering in the plane are NP-complete
- Sur les matroides orientes de rang 3 et les arrangements de pseudodroites dans le plan projectif réel
- On the Steiner, geodetic and hull numbers of graphs
- On the hull number of a graph.
- Geodetic number versus hull number in \(P_3\)-convexity
- ULD-Lattices and Δ-Bonds
- Convexity, geodetic, and hull numbers of the join of graphs
- Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
- Isometric Diamond Subgraphs
Cited In (23)
- Labeled sample compression schemes for complexes of oriented matroids
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor
- Finitary affine oriented matroids
- There are no finite partial cubes of girth more than 6 and minimum degree at least 3
- Arrangements of pseudocircles: on circularizability
- Daisy cubes and distance cube polynomial
- Hull and geodetic numbers for some classes of oriented graphs
- Hull and geodetic numbers for some classes of oriented graphs
- On the \(P_3\)-hull number of some products of graphs
- Corners and simpliciality in oriented matroids and partial cubes
- On tope graphs of complexes of oriented matroids
- Computing the hull number in toll convexity
- First-order logic axiomatization of metric graph theory
- A correction of a characterization of planar partial cubes
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- Convex excess in partial cubes
- Two-dimensional partial cubes
- On the parameterized complexity of the geodesic hull number
- Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids
- The hull number in the convexity of induced paths of order \(3\)
- Computing the hull and interval numbers in the weakly toll convexity
- On partial cubes, well-graded families and their duals with some applications in graphs
This page was built for publication: Convexity in partial cubes: the hull number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898152)
