Pages that link to "Item:Q5919325"
From MaRDI portal
The following pages link to Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325):
Displaying 5 items.
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254) (← links)
- Enumeration of irredundant forests (Q2672596) (← links)
- Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (Q6091158) (← links)