Pages that link to "Item:Q414425"
From MaRDI portal
The following pages link to Random generation and enumeration of bipartite permutation graphs (Q414425):
Displaying 7 items.
- Permutation bigraphs and interval containments (Q401140) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324) (← links)
