Pages that link to "Item:Q672268"
From MaRDI portal
The following pages link to A linear-time algorithm for proper interval graph recognition (Q672268):
Displayed 6 items.
- Proper interval graphs and the guard problem (Q1363667) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)