On the complexity of the P₃-hull number of the Cartesian product of graphs
DOI10.1016/J.ENDM.2016.10.042zbMATH Open1356.05120OpenAlexW2549449893MaRDI QIDQ510982FDOQ510982
Authors: Erika M. M. Coelho, Hebert Coelho, Julliano Rosa Nascimento, Jayme L. Szwarcfiter 
Publication date: 14 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.042
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Convex sets in graphs. II: Minimal path convexity
- Irreversible conversion of graphs
- The hull number of a graph
- Title not available (Why is that?)
- On the convexity of paths of length two in undirected graphs
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
Cited In (10)
- P3-factorization of triangulated Cartesian product of complete graphs
- Title not available (Why is that?)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- On the \(P_3\)-hull number of some products of graphs
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
- On the \(P_3\)-hull number of Hamming graphs
- \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order
- On \(P_{3}\)-convexity of graphs with bounded degree
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
- \(P_3\)-factorization of Cartesian product of complete graphs
This page was built for publication: On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510982)
