The following pages link to Nathan Lindzey (Q318915):
Displaying 14 items.
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Stability for 1-intersecting families of perfect matchings (Q1987088) (← links)
- On the algebraic combinatorics of injections (Q2199901) (← links)
- Erdős-Ko-Rado for perfect matchings (Q2400976) (← links)
- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs (Q2864314) (← links)
- Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
- Speeding up Graph Algorithms via Switching Classes (Q2946059) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank (Q4607957) (← links)
- On the Algebraic Combinatorics of Injections and its Applications to Injection Codes (Q5138865) (← links)
- (Q5875762) (← links)
- A Tight Lower Bound for Non-coherent Index Erasure (Q6314317) (← links)
- A note on “Largest independent sets of certain regular subgraphs of the derangement graph” (Q6491166) (← links)
