The following pages link to Optimal node ranking of trees (Q1113677):
Displaying 39 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- Ordered coloring of grids and related graphs (Q442258) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- Rank numbers of grid graphs (Q712259) (← links)
- Rank numbers for some trees and unicyclic graphs (Q719660) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Ranking numbers of graphs (Q765523) (← links)
- On an edge ranking problem of trees and graphs (Q803172) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← 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)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Greedy rankings and arank numbers (Q989495) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Optimal node ranking of tree in linear time (Q1825031) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- Ordered colourings (Q1896351) (← 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)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Rank numbers for bent ladders (Q2450128) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Graphs with large rank numbers and rank numbers of subdivided stars (Q5154613) (← links)
- (Q6089677) (← links)
