Search Results - "Borozan, Valentin"

Proper connection of graphs by Borozan, Valentin, Fujita, Shinya, Gerek, Aydin, Magnant, Colton, Manoussakis, Yannis, Montero, Leandro, Tuza, Zsolt

“…An edge-colored graph G is k-proper connected if every pair of vertices is connected by k internally pairwise vertex-disjoint proper colored paths. The…”
Get full text

Minimal Valid Inequalities for Integer Constraints by Borozan, Valentin, Cornuejols, Gerard

“…In this paper, we consider a semi-infinite relaxation of mixed-integer linear programs. We show that minimal valid inequalities for this relaxation correspond…”
Get full text

Proper Hamiltonian cycles in edge-colored multigraphs by Águeda, Raquel, Borozan, Valentin, Díaz, Raquel, Manoussakis, Yannis, Montero, Leandro

“…A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper Hamiltonian cycle…”
Get full text

Proper Hamiltonian Paths in Edge-Coloured Multigraphs by Águeda, Raquel, Borozan, Valentin, Groshaus, Marina, Manoussakis, Yannis, Mendy, Gervais, Montero, Leandro

“…Given a c -edge-coloured multigraph, where c is a positive integer, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such…”
Get full text

Partitioning a Graph into Highly Connected Subgraphs by Borozan, Valentin, Ferrara, Michael, Fujita, Shinya, Furuya, Michitaka, Manoussakis, Yannis, N, Narayanan, Stolee, Derrick

“…Given k≥1, a k‐proper partition of a graph G is a partition P of V(G) such that each part P of P induces a k‐connected subgraph of G. We prove that if G is a…”
Get full text

From Edge-Coloring to Strong Edge-Coloring by Borozan, Valentin, Chang, Gerard Jennhwa, Cohen, Nathann, Fujita, Shinya, Narayanan, Narayanan, Naserasr, Reza, Valicov, Petru

“…In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan…”
Get full text

Proper Hamiltonian Paths in Edge-Colored Multigraphs by Águeda, Raquel, Borozan, Valentin, Groshaus, Marina, Manoussakis, Yannis, Mendy, Gervais, Montero, Leandro

“…A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper hamiltonian path…”
Get full text

Further results on strong edge-colourings in outerplanar graphs by Borozan, Valentin, Montero, Leandro, Narayanan, Narayanan

“…An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the…”
Get full text

Proper Hamiltonian Cycles in Edge-Colored Multigraphs by Águeda, Raquel, Borozan, Valentin, Díaz, Raquel, Manoussakis, Yannis, Montero, Leandro

“…A $c$-edge-colored multigraph has each edge colored with one of the $c$ available colors and no two parallel edges have the same color. A proper Hamiltonian…”
Get full text

Proper Hamiltonian Paths in Edge-Coloured Multigraphs by Águeda, Raquel, Borozan, Valentin, Groshaus, Marina, Manoussakis, Yannis, Mendy, Gervais, Montero, Leandro

“…Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have…”
Get full text

Partitioning a graph into highly connected subgraphs by Borozan, Valentin, Ferrara, Michael, Fujita, Shinya, Furuya, Michitaka, Manoussakis, Yannis, Narayanan, N, Stolee, Derrick

“…Given $k\ge 1$, a $k$-proper partition of a graph $G$ is a partition ${\mathcal P}$ of $V(G)$ such that each part $P$ of ${\mathcal P}$ induces a $k$-connected…”
Get full text