Hull and geodetic numbers for some classes of oriented graphs

DOI10.1016/j.entcs.2019.08.008OpenAlexW2979290200WikidataQ113317425 ScholiaQ113317425MaRDI QIDQ5918666

Julio Araujo, Pedro Arraes

Publication date: 27 April 2022

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

Full work available at URL: https://arxiv.org/abs/1911.10240

zbMATH Keywords

computational complexityconvexityoriented graphsgeodetic numberhull number

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Convexity in partial cubes: the hull number
• Some remarks on the geodetic number of a graph
• On the geodesic pre-hull number of a graph
• The forcing hull and forcing geodetic numbers of graphs
• On the computation of the hull number of a graph
• The hull number of a graph
• The geodetic number of a graph
• The hull number of an oriented graph
• On the Steiner, geodetic and hull numbers of graphs
• On the hull number of some graph classes
• The geodetic number of an oriented graph
• Orientable convexity, geodetic and hull numbers in graphs
• Embedding tournaments in simple tournaments
• Some remarks on simple tournaments
• The forcing geodetic number of a graph
• The Geodetic Hull Number is Hard for Chordal Graphs
• Reducibility among Combinatorial Problems

This page was built for publication: Hull and geodetic numbers for some classes of oriented graphs