Tommy R. Jensen

According to our database1, Tommy R. Jensen authored at least 21 papers between 1995 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Graphs.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

2015
Decompositions of graphs into trees, forests, and regular subgraphs.
Discret. Math., 2015

2014
5-stars of low weight in normal plane maps with minimum degree 5.
Discuss. Math. Graph Theory, 2014

2013
Describing 3-paths in normal plane maps.
Discret. Math., 2013

2012
A step towards the strong version of Havel's three color conjecture.
J. Comb. Theory, Ser. B, 2012

2010
Graphs.
Proceedings of the Encyclopedia of Machine Learning, 2010

Splits of circuits.
Discret. Math., 2010

2009
A note on semiextensions of stable circuits.
Discret. Math., 2009

2007
On semiextensions and circuit double covers.
J. Comb. Theory, Ser. B, 2007

2006
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
J. Graph Theory, 2006

Domination analysis for minimum multiprocessor scheduling.
Discret. Appl. Math., 2006

On-line bin Packing with Two Item Sizes.
Algorithmic Oper. Res., 2006

2005
Batched bin packing.
Discret. Optim., 2005

Optimal On-Line Bin Packing with Two Item Sizes.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2002
Dense critical and vertex-critical graphs.
Discret. Math., 2002

2001
25 Pretty graph colouring problems.
Discret. Math., 2001

2000
The color space of a graph.
J. Graph Theory, 2000

1999
Hajós constructions of critical graphs.
J. Graph Theory, 1999

Highly Connected Sets and the Excluded Grid Theorem.
J. Comb. Theory, Ser. B, 1999

1995
Small graphs with chromatic number 5: A computer search.
J. Graph Theory, 1995

Note on a Conjecture of Toft.
Comb., 1995


  Loading...