Pages that link to "Item:Q2500963"
From MaRDI portal
The following pages link to Bounding the number of edges in permutation graphs (Q2500963):
Displaying 8 items.
- On the connected components of a random permutation graph with a given number of edges (Q388720) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- On random trees obtained from permutation graphs (Q738839) (← links)
- On permutation graphs (Q1942938) (← links)
- (Q3178790) (← links)
- (Q3606139) (← links)
- (Q4201938) (← links)
- Permutation graphs and the weak Bruhat order (Q5888419) (← links)