The following pages link to Edge ranking of graphs is hard (Q1392547):
Displaying 22 items.
- Facial edge ranking of plane graphs (Q494424) (← links)
- Ranking numbers of graphs (Q765523) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- A lower bound for on-line ranking number of a path (Q878626) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
