The following pages link to Tien-Nam Le (Q284760):
Displaying 15 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- Domination and fractional domination in digraphs (Q1671654) (← links)
- Additive bases and flows in graphs (Q1689948) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Coloring tournaments: from local to global (Q2312616) (← links)
- Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499) (← links)
- Every 3-colorable graph has a faithful representation in the odd-distance graph (Q2344791) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- Additive Bases and Flows in Graphs (Q4605444) (← links)
- (Q4607901) (← links)
- Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems (Q4629983) (← links)
- Forcing clique immersions through chromatic number (Q5892297) (← links)
- Coloring dense digraphs (Q5915818) (← links)
- Locally self-avoiding Eulerian tours (Q5915927) (← links)
- Coloring dense digraphs (Q5919339) (← links)