Pages that link to "Item:Q338587"

The following pages link to Decomposing graphs into a constant number of locally irregular subgraphs (Q338587):

Displaying 18 items.

• Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
• A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
• New bounds for locally irregular chromatic index of bipartite and subcubic graphs (Q1631691) (← links)
• Graph classes with locally irregular chromatic index at most 4 (Q2095566) (← links)
• Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
• Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
• On the standard \((2,2)\)-conjecture (Q2662793) (← links)
• On locally irregular decompositions of subcubic graphs (Q4561210) (← links)
• A Note on the Locally Irregular Edge Colorings of Cacti (Q5884259) (← links)
• Decomposing split graphs into locally irregular graphs (Q5918672) (← links)
• Decomposing split graphs into locally irregular graphs (Q5919073) (← links)
• A generalization of Faudree–Lehel conjecture holds almost surely for random graphs (Q6052468) (← links)
• Locally irregular edge-coloring of subcubic graphs (Q6064843) (← links)
• Modulo orientations with bounded out-degrees (Q6080113) (← links)
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
• Local irregularity conjecture for 2-multigraphs versus cacti (Q6091083) (← links)
• On decomposing multigraphs into locally irregular submultigraphs (Q6105994) (← links)
• Local irregularity conjecture vs. cacti (Q6180651) (← links)