Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

Unnamed Item
Complexity properties of complementary prisms
Irreversible conversion of graphs
Complexity aspects of $\ell$-chord convexities
Complexity analysis of $P_3$-convexity problems on bounded-degree and planar graphs
On the $P_3$-hull number of some products of graphs
And/or-convexity: a graph convexity based on processes and deadlock models
Corrigendum to ``Complexity analysis of $P_{3}$-convexity problems on bounded-degree and planar graphs
The maximum time of 2-neighbor bootstrap percolation: complexity results
On the hardness of finding the geodetic number of a subcubic graph
On the computational complexity of the Helly number in the $P_3$ and related convexities
$P_3$-hull number of graphs with diameter two
A general framework for path convexities
On the Carathéodory and exchange numbers of geodetic convexity in graphs
Covering graphs with convex sets and partitioning graphs into convex sets
The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
The Carathéodory number of the $P_3$ convexity of chordal graphs
Geodetic Number versus Hull Number in $P_3$-Convexity
Topics in Intersection Graph Theory
On the Carathéodory Number for the Convexity of Paths of Order Three

This page was built for publication: Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs