On the hull number on cycle convexity of graphs

DOI10.1016/j.ipl.2023.106420zbMath1529.05111MaRDI QIDQ6072203

Julio Araujo, António M. Salgueiro, João Miguel Nogueira, Victor A. Campos, Darlan Girão, Unnamed Author

Publication date: 12 October 2023

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmscomputational complexitygraph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreversible conversion of graphs
• A simplified NP-complete satisfiability problem
• The maximum infection time in the geodesic and monophonic convexities
• Convex sets in graphs. II: Minimal path convexity
• Convexity in graphs
• The convexity of induced paths of order three and applications: complexity aspects
• Linear time optimization algorithms for \(P_ 4\)-sparse graphs
• The hull number in the convexity of induced paths of order 3
• On two-path convexity in multipartite tournaments
• The Carathéodory number of the \(P_3\) convexity of chordal graphs
• Geodesic Convexity in Graphs
• On the Radon Number for P 3-Convexity
• Percolation
• Convexity in Graphs and Hypergraphs
• Planar 3-SAT with a clause/variable cycle
• On links minimizing the tunnel number

This page was built for publication: On the hull number on cycle convexity of graphs