Tien-Nam Le

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Integer solutions of $a^2+ab+b^2=7^n$	2021-04-18	Paper
Coloring dense digraphs Combinatorica	2020-01-17	Paper
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture Combinatorica	2019-09-04	Paper
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture Combinatorica	2019-09-04	Paper
Forcing clique immersions through chromatic number European Journal of Combinatorics	2019-08-30	Paper
Coloring tournaments: from local to global Journal of Combinatorial Theory. Series B	2019-07-17	Paper
Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems ACM Transactions on Algorithms	2019-03-28	Paper
Locally self-avoiding Eulerian tours Journal of Combinatorial Theory. Series B	2019-02-08	Paper
A proof of the Barát-Thomassen conjecture Journal of Combinatorial Theory. Series B	2018-10-29	Paper
Domination and fractional domination in digraphs The Electronic Journal of Combinatorics	2018-09-07	Paper
Domination and fractional domination in digraphs The Electronic Journal of Combinatorics	2018-09-07	Paper
Locally self-avoiding Eulerian tours Electronic Notes in Discrete Mathematics	2018-04-09	Paper
Subquadratic kernels for implicit 3-hitting set and 3-set packing problems	2018-03-15	Paper
Additive bases and flows in graphs SIAM Journal on Discrete Mathematics	2018-02-22	Paper
Coloring dense digraphs Electronic Notes in Discrete Mathematics	2018-01-18	Paper
Additive bases and flows in graphs (available as arXiv preprint)	2018-01-18	Paper
Forcing clique immersions through chromatic number Electronic Notes in Discrete Mathematics	2017-02-13	Paper
Linearity is strictly more powerful than contiguity for encoding graphs Discrete Mathematics	2016-05-18	Paper
Linearity is strictly more powerful than contiguity for encoding graphs Lecture Notes in Computer Science	2015-10-30	Paper
Every 3-colorable graph has a faithful representation in the odd-distance graph Discrete Mathematics	2015-05-18	Paper

Research outcomes over time

This page was built for person: Tien-Nam Le