Pages that link to "Item:Q2342634"
From MaRDI portal
The following pages link to On vertex rankings of graphs and its relatives (Q2342634):
Displaying 15 items.
- On graphs associated to sets of rankings (Q491081) (← links)
- Some relations between rank of a graph and its complement (Q869950) (← links)
- Graph 2-rankings (Q1733856) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- Behavior of the binary rank of a graph when vertices and edges are added (Q2131415) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434) (← links)
- Ranking measures for radially Moore graphs (Q3064042) (← links)
- Ranking the Vertices of a Paired Comparison Digraph (Q3689208) (← links)
- (Q4364591) (← links)
- A GENERALISATION OF HIGHER-RANK GRAPHS (Q5069272) (← links)
- A new notion of vertex independence and rank for finite graphs (Q5246507) (← links)
- Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs (Q5866455) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)