Rankings of Graphs
From MaRDI portal
Recommendations
Cited in
(90)- Biconvex graphs: Ordering and algorithms
- Algorithms for generalized vertex-rankings of partial k-trees
- On vertex ranking of a starlike graph
- Safe sets in graphs: graph classes and structural parameters
- Greedy algorithms for generalized k-rankings of paths
- Beyond rankings: comparing directed acyclic graphs
- Arankings of trees
- Graph 2-rankings
- On 1-uniqueness and dense critical graphs for tree-depth
- Maximum matchings of a digraph based on the largest geometric multiplicity
- Finding the edge ranking number through vertex partitions
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- On-line rankings of graphs
- On the diameter of tree associahedra
- Conflict-free connection of trees
- Descriptional complexity of regular languages
- Diameter estimates for graph associahedra
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
- The complexity of restricted star colouring
- Polynomial treedepth bounds in linear colorings
- (Strong) conflict-free connectivity: algorithm and complexity
- Width, depth, and space: tradeoffs between branching and dynamic programming
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
- On vertex rankings of graphs and its relatives
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
- Rank numbers for bent ladders
- Easy and hard instances of arc ranking in directed graphs
- Minimal rankings and the arank number of a path
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
- List rankings and on-line list rankings of graphs
- Compact representation of graphs with bounded bandwidth or treedepth
- Obstructions for tree-depth
- Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
- The complexity of regular(-like) expressions
- Vertex ranking of asteroidal triple-free graphs
- Safe sets in graphs: graph classes and structural parameters
- Extrema property of the \(k\)-ranking of directed paths and cycles
- On the power of tree-depth for fully polynomial FPT algorithms
- From rankings’ collinearity to counting SDR's via chromatic list expression
- Characterizing width two for variants of treewidth
- A note on on-line ranking number of graphs
- Graphical methods for ranking data
- Forbidden graphs for tree-depth
- scientific article; zbMATH DE number 1262792 (Why is no real title available?)
- Ordered coloring of grids and related graphs
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- Rankings of Directed Graphs
- On graphs associated to sets of rankings
- Computing tree-depth faster than \(2^n\)
- Facial edge ranking of plane graphs
- Elimination Distance to Bounded Degree on Planar Graphs
- Graphs with large rank numbers and rank numbers of subdivided stars
- Provably shorter regular expressions from finite automata
- A survey and classification of Sierpiński-type graphs
- Parallel Processing and Applied Mathematics
- On low rank-width colorings
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- Competitive Online Search Trees on Trees
- Graphs of bounded depth‐2 rank‐brittleness
- Efficient interprocedural data-flow analysis using treedepth and treewidth
- Rankings of graphs
- Graph unique-maximum and conflict-free colorings
- A survey on conflict-free connection coloring of graphs
- On the size of minimal separators for treedepth decomposition
- A graph searching game for block treedepth and a cubic kernel by vertex cover
- Elimination distance to bounded degree on planar graphs preprint
- Turbocharging heuristics for weak coloring numbers
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- Combinatorial generation via permutation languages. IV: Elimination trees
- Rank numbers of grid graphs
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Rank numbers for some trees and unicyclic graphs
- Linear colorings of graphs
- A parameterized complexity analysis of bounded height depth-first search trees
- Linear versus centred colouring via pseudogrids
- Max-optimal and sum-optimal labelings of graphs
- Ranking numbers of graphs
- An optimal parallel algorithm forc-vertex-ranking of trees
- Vertex rankings of chordal graphs and weighted trees
- Minimum edge ranking spanning trees of split graphs
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
- A lower bound for on-line ranking number of a path
- Constructing a minimum height elimination tree of a tree in linear time
- Maximizing the number of edges in optimal \(k\)-rankings
- On low tree-depth decompositions
- Uniqueness and minimal obstructions for tree-depth
- Optimal vertex ranking of block graphs
- Minimal k-rankings and the rank number of P^2_n
This page was built for publication: Rankings of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388986)
