22 citations · 34 across the 13 of their papers we have counts for
3 papers · 1 filter
Strong edge-coloring of -bipartite graphs
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
A strong edge-coloring of a graph is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of max…
Analogous to cliques for (m,n)-colored mixed graphs
Julien Bensmail, Christopher Duffy, Sagnik Sen
Vertex coloring of a graph with -colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of to the complete graph of order $…
Strong edge-colouring of sparse planar graphs
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard +1
A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree has a strong e…