Ordered colourings
From MaRDI portal
Publication:1896351
DOI10.1016/0012-365X(93)E0216-QzbMath0842.05032OpenAlexW2913683243MaRDI QIDQ1896351
William D. McCuaig, Meir Katchalski, Suzanne M. Seager
Publication date: 17 July 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0216-q
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (40)
A polynomial excluded-minor approximation of treedepth ⋮ Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ Vertex ranking of asteroidal triple-free graphs ⋮ Ordered colourings ⋮ Maximum value of conflict-free vertex-connection number of graphs ⋮ The complexity of restricted star colouring ⋮ A lower bound for on-line ranking number of a path ⋮ On the Power of Tree-Depth for Fully Polynomial FPT Algorithms ⋮ Constructing a minimum height elimination tree of a tree in linear time ⋮ Edge ranking of graphs is hard ⋮ Forbidden graphs for tree-depth ⋮ Uniqueness and minimal obstructions for tree-depth ⋮ On facial unique-maximum (edge-)coloring ⋮ Unique-maximum coloring of plane graphs ⋮ Graph unique-maximum and conflict-free colorings ⋮ Finding the edge ranking number through vertex partitions ⋮ Ordered coloring of grids and related graphs ⋮ On the vertex ranking problem for trapezoid, circular-arc and other graphs ⋮ Arankings of trees ⋮ Rank numbers for bent ladders ⋮ Computing tree-depth faster than \(2^n\) ⋮ Easy and hard instances of arc ranking in directed graphs ⋮ On 1-uniqueness and dense critical graphs for tree-depth ⋮ Optimal vertex ranking of block graphs ⋮ PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA ⋮ LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth ⋮ Rank numbers for some trees and unicyclic graphs ⋮ (Strong) conflict-free connectivity: algorithm and complexity ⋮ Width, depth, and space: tradeoffs between branching and dynamic programming ⋮ Hitting sets online and unique-MAX coloring ⋮ The complexity of bicriteria tree-depth ⋮ Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces ⋮ Ranking numbers of graphs ⋮ Ordered Coloring Grids and Related Graphs ⋮ Algorithms for generalized vertex-rankings of partial k-trees ⋮ On a problem concerning ordered colourings ⋮ Obstructions for Tree-depth ⋮ Diameter estimates for graph associahedra ⋮ Unique-maximum edge-colouring of plane graphs with respect to faces ⋮ On vertex rankings of graphs and its relatives
Cites Work
- Optimizing over the subtour polytope of the travelling salesman problem
- Optimal node ranking of trees
- Local optimization on graphs
- Ordered colourings
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Cyclability of r-regular r-connected graphs
- On the Problem of Partitioning Planar Graphs
- Subgraphs and well‐quasi‐ordering
- Ordering by Divisibility in Abstract Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ordered colourings
