The following pages link to Rankings of Graphs (Q4388986):
Displaying 25 items.
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Rank numbers for bent ladders (Q2450128) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Minimal rankings and the arank number of a path (Q2501577) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Obstructions for tree-depth (Q2851471) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- The complexity of regular(-like) expressions (Q2909093) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Graphical methods for ranking data (Q4036397) (← links)
- (Q4625695) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- On low rank-width colorings (Q5918207) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
- A graph searching game for block treedepth and a cubic kernel by vertex cover (Q6590085) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
