List rankings and on-line list rankings of graphs
From MaRDI portal
Publication:266945
DOI10.1016/j.dam.2015.12.014zbMath1333.05267arXiv1401.3498OpenAlexW2229122671MaRDI QIDQ266945
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3498
Cites Work
- Unnamed Item
- Unnamed Item
- Characterisations and examples of graph classes with bounded expansion
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- On an edge ranking problem of trees and graphs
- Edge ranking and searching in partial orders
- Greedy rankings and arank numbers
- Optimal node ranking of trees
- Mr. Paint and Mrs. Correct
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Tree-depth, subgraph coloring and homomorphism bounds
- On-Line Vertex Ranking of Trees
- Rankings of Graphs
- On-line ranking number for cycles and paths