The following pages link to Rankings of Graphs (Q4388986):
Displaying 50 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Extrema property of the \(k\)-ranking of directed paths and cycles (Q322050) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Ordered coloring of grids and related graphs (Q442258) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- Rank numbers of grid graphs (Q712259) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Rank numbers for some trees and unicyclic graphs (Q719660) (← links)
- Max-optimal and sum-optimal labelings of graphs (Q763483) (← links)
- Ranking numbers of graphs (Q765523) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← 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)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- Maximizing the number of edges in optimal \(k\)-rankings (Q896093) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Minimal \(k\)-rankings and the rank number of \(P^2_n\) (Q976072) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Greedy algorithms for generalized \(k\)-rankings of paths (Q1675774) (← links)
- Arankings of trees (Q1717194) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Maximum matchings of a digraph based on the largest geometric multiplicity (Q1793197) (← 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 the diameter of tree associahedra (Q1991427) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← 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)
