On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs

DOI10.1016/j.endm.2016.10.042zbMath1356.05120OpenAlexW2549449893MaRDI QIDQ510982

Erika M. M. Coelho, Hebert Coelho, Julliano Rosa Nascimento, Jayme Luiz Szwarcfiter

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.042

zbMATH Keywords

Cartesian product\(P_3\)-convexity\(P_3\)-hull number

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Irreversible conversion of graphs
• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
• The hull number of a graph
• Convex sets in graphs. II: Minimal path convexity
• On the Convexity of Paths of Length Two in Undirected Graphs

This page was built for publication: On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs