On the complexity of the P₃-hull number of the Cartesian product of graphs

DOI10.1016/J.ENDM.2016.10.042MaRDI QIDQ510982zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• On the \(P_3\)-hull number of some products of graphs
• On the \(P_3\)-hull number of Hamming graphs
• Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
• On the hull sets and hull number of the Cartesian product of graphs
• On \(P_{3}\)-convexity of graphs with bounded degree

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 5066400 (Why is no real title available?)
• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
• Convex sets in graphs. II: Minimal path convexity
• Irreversible conversion of graphs
• On the convexity of paths of length two in undirected graphs
• The hull number of a graph

Cited in

(10)

• On the \(P_3\)-hull number of some products of graphs
• P₃-factorization of triangulated Cartesian product of complete graphs
• scientific article; zbMATH DE number 1933225 (Why is no real title available?)
• On the \(P_3\)-hull number of Hamming graphs
• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
• \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order
• Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
• On \(P_{3}\)-convexity of graphs with bounded degree
• \(P_3\)-factorization of Cartesian product of complete graphs
• The Carathéodory number of the \(P_3\) convexity of chordal 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)