Pages that link to "Item:Q3503548"
From MaRDI portal
The following pages link to Algorithmic Aspects of Monophonic Convexity (Q3503548):
Displaying 23 items.
- Equivalence between hypergraph convexities (Q410668) (← links)
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- Decomposable convexities in graphs and hypergraphs (Q1952718) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Extreme-support total monophonic graphs (Q2666383) (← links)
- On the convexity of paths of length two in undirected graphs (Q2839205) (← links)
- On the \(m\)-hull number of the join and composition of graphs. (Q2846655) (← links)
- Minimal trees and monophonic convexity (Q2866415) (← links)
- Local \(3\)-monophonic convexity (Q2895328) (← links)
- On the (M, D) number of a graph (Q3294993) (← links)
- Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
- The total detour monophonic number of a graph (Q4634458) (← links)
- On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs (Q5013412) (← links)
- (Q5021246) (← links)
- Further results on the outer connected monophonic number of a graph (Q5050650) (← links)
- Minimal outer connected monophonic sets in graphs (Q5061365) (← links)
- Minimal connected restrained monophonic sets in graphs (Q5866632) (← links)
- On the monophonic rank of a graph (Q6045452) (← links)
- The total outer connected monophonic number of a graph (Q6050413) (← links)
- (Q6101492) (← links)
- On monophonic position sets in graphs (Q6558674) (← links)
- The connected and forcing connected restrained monophonic numbers of a graph (Q6563262) (← links)
