Algorithmic Aspects of Monophonic Convexity

DOI10.1016/J.ENDM.2008.01.031MaRDI QIDQ3503548zbMATH OpenOpenAlexFDO

Authors Mitre C. Dourado, Fábio Protti, Jayme L. 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

m-convex setm-convexity numberm-hull numberm-hull setmonophonic convexitymonophonic numbermonophonic set

Mathematics Subject Classification ID

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

Recommendations

• Complexity results related to monophonic convexity
• The monophonic detour hull number of a graph
• On the monophonic rank of a graph
• On the computation of the hull number of a graph
• On the hull number of some graph classes

Cites work

• Chordless paths through three vertices
• Convexities related to path properties on graphs
• Convexity in Graphs and Hypergraphs
• Corrigendum to: On the complexity of testing for odd holes and induced odd paths
• Generalizing the Krein-Milman property in graph convexity spaces: a short survey
• On the computation of the hull number of a graph
• On the convexity number of graphs
• Some remarks on the convexity number of a graph

Cited in

(31)

• Decomposable convexities in graphs and hypergraphs
• On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
• Extreme-support total monophonic graphs
• On the convexity of paths of length two in undirected graphs
• On the m-hull number of the join and composition of graphs.
• Minimal trees and monophonic convexity
• Local 3-monophonic convexity
• On the (M, D) number of a graph
• Minimal path convexity under some graph operations
• Equivalence between hypergraph convexities
• scientific article; zbMATH DE number 1539545 (Why is no real title available?)
• Two classes of graphs in which some problems related to convexity are efficiently solvable
• Monophonic convexity in weighted graphs
• The total detour monophonic number of a graph
• Inapproximability results related to monophonic convexity
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• On the complement connected Steiner number of a graph
• Further results on the outer connected monophonic number of a graph
• scientific article; zbMATH DE number 7641207 (Why is no real title available?)
• Minimal connected restrained monophonic sets in graphs
• On the monophonic rank of a graph
• scientific article; zbMATH DE number 7739488 (Why is no real title available?)
• Extreme outer connected monophonic graphs
• On the monophonic convexity in complementary prisms
• On monophonic position sets in graphs
• The connected and forcing connected restrained monophonic numbers of a graph
• On the open monophonic number of a graph
• On some extremal position problems for graphs
• The total monophonic number of a graph
• On the monophonic global domination number of a graph
• Complexity results related to monophonic convexity

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

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