Valentin Borozan

According to our database1, Valentin Borozan authored at least 12 papers between 2009 and 2019.

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

2019
Maximum colored trees in edge-colored graphs.
Eur. J. Comb., 2019

2017
Proper Hamiltonian Paths in Edge-Coloured Multigraphs.
Graphs Comb., 2017

Proper Hamiltonian cycles in edge-colored multigraphs.
Discret. Math., 2017

2016
Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory, 2016

2015
From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015

Further results on strong edge-colourings in outerplanar graphs.
Australas. J Comb., 2015

2012
Proper connection of graphs.
Discret. Math., 2012

Sufficient conditions for the existence of spanning colored trees in edge-colored graphs.
Discret. Math., 2012

2011
Proper and weak-proper trees in edges-colored graphs and multigraphs. (Arbres proprement et faiblement arêtes-coloriées dans les graphes et multigraphes arêtes-coloriées).
PhD thesis, 2011

Proper Hamiltonian Paths in Edge-Colored Multigraphs.
Electron. Notes Discret. Math., 2011

2009
Minimal Valid Inequalities for Integer Constraints.
Math. Oper. Res., 2009

Colored Trees in Edge-Colored Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009


  Loading...