Pages that link to "Item:Q4887747"
From MaRDI portal
The following pages link to A linear time algorithm to recognize circular permutation graphs (Q4887747):
Displaying 6 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Switching to Hedgehog-Free Graphs Is NP-Complete (Q3010425) (← links)
- On Switching to <i>H</i>‐Free Graphs (Q5417832) (← links)
- Partial and simultaneous transitive orientations via modular decompositions (Q6130330) (← links)
