scientific article
From MaRDI portal
Publication:2857318
zbMath1274.05120MaRDI QIDQ2857318
No author found.
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311000783
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Hull number: \(P_5\)-free graphs and reduction rules ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ On the Carathéodory number of interval and graph convexities ⋮ Inapproximability results for graph convexity parameters
Cites Work
- Unnamed Item
- On the computation of the hull number of a graph
- The hull number of a graph
- Modular decomposition and transitive orientation
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- On the structure of graphs with few \(P_4\)s
- The hull number of an oriented graph
- On the hull sets and hull number of the Cartesian product of graphs
- On the Hull Number of Triangle-Free Graphs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Convexity in Graphs and Hypergraphs
This page was built for publication:
