Pages that link to "Item:Q497328"
From MaRDI portal
The following pages link to On the complexity of deciding whether the regular number is at most two (Q497328):
Displaying 8 items.
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- On the in-out-proper orientations of graphs (Q2043367) (← links)
- On the proper arc labeling of directed graphs (Q2062885) (← links)
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- On the algorithmic complexity of zero-sum edge-coloring (Q2630333) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Path partitions of phylogenetic networks (Q6652450) (← links)
