The following pages link to Ordered colourings (Q1896351):
Displaying 41 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)
- 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)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- The complexity of restricted star colouring (Q2161257) (← 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)
- Unique-maximum edge-colouring of plane graphs with respect to faces (Q2341735) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Rank numbers for bent ladders (Q2450128) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Obstructions for Tree-depth (Q2851471) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- Maximum value of conflict-free vertex-connection number of graphs (Q4554541) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
