Pages that link to "Item:Q391137"
From MaRDI portal
The following pages link to Algorithmic complexity of proper labeling problems (Q391137):
Displayed 21 items.
- On strongly planar not-all-equal 3SAT (Q326466) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← 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 complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs (Q2132413) (← links)
- Additive list coloring of planar graphs with given girth (Q2175242) (← 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)
- A lower bound and several exact results on the \(d\)-lucky number (Q2284776) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
- On locally irregular decompositions of subcubic graphs (Q4561210) (← links)
- On gap-labellings of some families of graphs (Q6048440) (← links)
- The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures (Q6132535) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)