The hull number in the convexity of induced paths of order \(3\)

DOI10.1016/j.tcs.2022.01.004OpenAlexW4206384561MaRDI QIDQ2077392

Mitre C. Dourado, Dieter Rautenbach, Lucia Draque Penso

Publication date: 21 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.004

zbMATH Keywords

chordal graphgraph convexityhull numberunit interval graph2-distance shortest path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Hull number: \(P_5\)-free graphs and reduction rules
• Dynamic algorithms for monotonic interval scheduling problem
• Inapproximability results for graph convexity parameters
• Irreversible conversion of graphs
• Convexity in partial cubes: the hull number
• Complexity results related to monophonic convexity
• On the computation of the hull number of a graph
• Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs
• The convexity of induced paths of order three and applications: complexity aspects
• On the hull number of some graph classes
• On the parameterized complexity of the geodesic hull number
• On the geodetic hull number of \(P_{k}\)-free graphs
• The Geodetic Hull Number is Hard for Chordal Graphs
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• Linear-Time Recognition of Probe Interval Graphs

This page was built for publication: The hull number in the convexity of induced paths of order \(3\)