The following pages link to Ordered colourings (Q1896351):
Displaying 21 items.
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← 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)
- Graph unique-maximum and conflict-free colorings (Q635736) (← 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)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Ranking numbers of graphs (Q765523) (← 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)
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- On a problem concerning ordered colourings (Q1584394) (← links)
- On facial unique-maximum (edge-)coloring (Q1701086) (← links)
- Arankings of trees (Q1717194) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
