Algorithmic Aspects of Monophonic Convexity

DOI10.1016/j.endm.2008.01.031zbMath1341.05133OpenAlexW2041685149MaRDI QIDQ3503548

Mitre C. Dourado, Fábio Protti, Jayme Luiz Szwarcfiter

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.031

zbMATH Keywords

monophonic convexitymonophonic setm-convex setm-convexity numberm-hull numbermonophonic numberm-hull set

Mathematics Subject Classification ID

Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

Extreme-support total monophonic graphs ⋮ Equivalence between hypergraph convexities ⋮ Decomposable convexities in graphs and hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the (M, D) number of a graph ⋮ The total detour monophonic number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs ⋮ On the Convexity of Paths of Length Two in Undirected Graphs ⋮ On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs ⋮ Minimal connected restrained monophonic sets in graphs

Cites Work

• Unnamed Item
• Chordless paths through three vertices
• On the computation of the hull number of a graph
• Corrigendum to: On the complexity of testing for odd holes and induced odd paths
• Some remarks on the convexity number of a graph
• Convexities related to path properties on graphs
• On the convexity number of graphs
• Convexity in Graphs and Hypergraphs

This page was built for publication: Algorithmic Aspects of Monophonic Convexity