On the hull and interval numbers of oriented graphs

DOI10.1016/J.DAM.2026.02.036MaRDI QIDQ7237668zbMATH OpenFDO

Authors Júlio Araújo, Ana Karolinna Maia, P. Medeiros, Lucia Draque Penso

Publication date 30 April 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.036

zbMATH Keywords

graph convexityhull numberinterval numberoriented graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) General convexity (52A99)

Cites work

• Convex sets in graphs. II: Minimal path convexity
• Convexity in Graphs and Hypergraphs
• Convexity in partial cubes: the hull number
• Digraphs
• Embedding tournaments in simple tournaments
• Graph structure and monadic second-order logic. A language-theoretic approach
• Graph theory
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3873388 (Why is no real title available?)
• scientific article; zbMATH DE number 3545692 (Why is no real title available?)
• scientific article; zbMATH DE number 5238170 (Why is no real title available?)
• scientific article; zbMATH DE number 2191983 (Why is no real title available?)
• Hull and geodetic numbers for some classes of oriented graphs
• Inapproximability results and bounds for the Helly and Radon numbers of a graph
• On Convex Subsets in Tournaments
• On the Carathéodory number for the convexity of paths of order three
• On the convexity of paths of length two in undirected graphs
• On the geodesic pre-hull number of a graph
• On the geodetic rank of a graph
• On the parameterized complexity of the geodesic hull number
• On the Steiner, geodetic and hull numbers of graphs
• On two-path convexity in multipartite tournaments
• Orientable convexity, geodetic and hull numbers in graphs
• Parameterized algorithms
• Perfect Elimination and Chordal Bipartite Graphs
• Some Elementary Properties of Interval Convexities
• Some remarks on simple tournaments
• The convexity of induced paths of order three and applications: complexity aspects
• The forcing geodetic number of a graph
• The forcing hull and forcing geodetic numbers of graphs
• The geodetic number of a graph
• The geodetic number of an oriented graph
• The hull number of a graph
• The hull number of an oriented graph
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• Upper bounds to the clique width of graphs

This page was built for publication: On the hull and interval numbers of oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237668)