Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach

DOI10.1016/j.dam.2018.08.013zbMath1405.05181OpenAlexW2895968540MaRDI QIDQ1727735

Javier Marenco, Manuela Blaum

Publication date: 20 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.013

zbMATH Keywords

facet-defining inequalitiescombinatorial optimizationdiscrete convexityHull number

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph theory (05C99)

Related Items (1)

Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity aspects of the triangle path convexity
• Largest and smallest minimal percolating sets in trees
• Irreversible conversion of graphs
• Complexity results related to monophonic convexity
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• On triangle path convexity in graphs
• On the Convexity of Paths of Length Two in Undirected Graphs
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• On the Approximability of Influence in Social Networks

This page was built for publication: Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach