The convexity of induced paths of order three and applications: complexity aspects
From MaRDI portal
Publication:1701089
DOI10.1016/j.dam.2017.11.007zbMath1380.05031OpenAlexW2773033757MaRDI QIDQ1701089
Rafael T. Araújo, Jayme Luiz Szwarcfiter, Vinícius Fernandes dos Santos, Rudini Menezes Sampaio
Publication date: 22 February 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.11.007
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Density (toughness, etc.) (05C42)
Related Items (6)
Establishing herd immunity is hard even in simple geometric networks ⋮ On the hull number on cycle convexity of graphs ⋮ Domination and convexity problems in the target set selection model ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results ⋮ The hull number in the convexity of induced paths of order \(3\)
Cites Work
- Unnamed Item
- Algorithmic and structural aspects of the \(P_3\)-Radon number
- On the Carathéodory number of interval and graph convexities
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Irreversible conversion of graphs
- Some remarks on the geodetic number of a graph
- Complexity results related to monophonic convexity
- A tree representation for \(P_ 4\)-sparse graphs
- On triangle path convexity in graphs
- On the convexity number of graphs
- On the hull number of some graph classes
- Embedding tournaments in simple tournaments
- Some remarks on simple tournaments
- On the Convexity of Paths of Length Two in Undirected Graphs
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
- Planar Formulae and Their Uses
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Convexity and HHD-Free Graphs
- The Complexity of Multiterminal Cuts
- On the Carathéodory Number for the Convexity of Paths of Order Three
This page was built for publication: The convexity of induced paths of order three and applications: complexity aspects
