On the \(P_3\)-hull number of Hamming graphs
From MaRDI portal
Publication:2185729
DOI10.1016/j.dam.2019.11.011zbMath1441.05196OpenAlexW2990922105MaRDI QIDQ2185729
Boštjan Brešar, Mario Valencia-Pabon
Publication date: 5 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.11.011
Related Items
On the \(P_3\)-hull number of Kneser graphs ⋮ On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing Hamming graphs in linear time and space
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
- Complexity results related to monophonic convexity
- Quasi-median hulls in Hamming space are Steiner hulls
- Convex sets in graphs. II: Minimal path convexity
- Metric extensions and the \(L^ 1\) hierarchy
- On the \(P_3\)-hull number of some products of graphs
- On two-path convexity in multipartite tournaments
- Some remarks on simple tournaments
- On the geodetic hull number of \(P_{k}\)-free graphs
- Geodetic Number versus Hull Number in $P_3$-Convexity
- Geodesic Convexity in Graphs
- On the Hull Number of Triangle-Free Graphs
- Geodetic Sets in Graphs
- Convexity in Graphs and Hypergraphs
- Random disease on the square grid
- On the Carathéodory Number for the Convexity of Paths of Order Three
- Some Elementary Properties of Interval Convexities
