Pages that link to "Item:Q2253909"
From MaRDI portal
The following pages link to On the complexity of determining the irregular chromatic index of a graph (Q2253909):
Displaying 15 items.
- Decomposing graphs into a constant number of locally irregular subgraphs (Q338587) (← links)
- 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)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← 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)
- Locally irregular edge-coloring of subcubic graphs (Q6064843) (← 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)
