The following pages link to Julien Bensmail (Q244929):
Displaying 50 items.
- Strong edge coloring sparse graphs (Q324370) (← links)
- Decomposing graphs into a constant number of locally irregular subgraphs (Q338587) (← links)
- Decomposing oriented graphs into six locally irregular oriented graphs (Q343709) (← links)
- Partitioning powers of traceable or Hamiltonian graphs (Q391776) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- On \(q\)-power cycles in cubic graphs (Q503679) (← links)
- Structural properties of recursively partitionable graphs with connectivity 2 (Q505469) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← links)
- Erratum to: ``On oriented cliques with respect to push operation'' (Q1732122) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) (Q2062679) (← links)
- On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs (Q2098173) (← links)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- Going wide with the 1-2-3 conjecture (Q2166211) (← links)
- On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- On oriented cliques with respect to push operation (Q2410221) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q2413142) (← links)
- Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
- An injective version of the 1-2-3 conjecture (Q2657086) (← links)
- On generalisations of the AVD conjecture to digraphs (Q2657104) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- On a vertex-capturing game (Q2672611) (← links)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q2672623) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- On the pushable chromatic number of various types of grids (Q2686138) (← links)
- On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
- The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534) (← links)
- Edge-partitioning graphs into regular and locally irregular components (Q2808535) (← links)
- On the longest path in a recursively partitionable graph (Q2864638) (← links)
