Pages that link to "Item:Q1708605"
From MaRDI portal
The following pages link to A new graph parameter to measure linearity (Q1708605):
Displaying 9 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- A five-element transformation monoid on labelled trees (Q2311382) (← links)
- (Q4669372) (← links)
- The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs (Q4987262) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- (Q5743413) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)